UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Planar graph with twin-width seven

European journal of combinatorics, 2025-01, Vol.123, p.103749, Article 103749

2025

Volltextzugriff (PDF)

Forcing generalised quasirandom graphs efficiently

Combinatorics, probability & computing, 2024-01, Vol.33 (1), p.16-31

2024

Volltextzugriff (PDF)

A bound on the inducibility of cycles

Journal of combinatorial theory. Series A, 2019-01, Vol.161, p.359-363

2019

Volltextzugriff (PDF)

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

Mathematical programming, 2024, Vol.208 (1-2), p.497-531

2024

Volltextzugriff (PDF)

Permutations with fixed pattern densities

Random structures & algorithms, 2020-01, Vol.56 (1), p.220-250

2020

Volltextzugriff (PDF)

Steinberg's Conjecture is false

Journal of combinatorial theory. Series B, 2017-01, Vol.122, p.452-456

2017

Volltextzugriff (PDF)

Testing First-Order Properties for Subclasses of Sparse Graphs

Journal of the ACM, 2013-10, Vol.60 (5), p.1-24

2013

Volltextzugriff (PDF)

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations

Journal of combinatorial theory. Series B, 2024-01, Vol.164, p.517-548

2024

Volltextzugriff (PDF)

On the number of pentagons in triangle-free graphs

Journal of combinatorial theory. Series A, 2013-04, Vol.120 (3), p.722-732

2013

Volltextzugriff (PDF)

Uniform Turán density of cycles

Transactions of the American Mathematical Society, 2023-07, Vol.376 (7), p.4765-4809

2023

Volltextzugriff (PDF)

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies

Journal of combinatorial theory. Series B, 2021-09, Vol.150, p.244-269

2021

Volltextzugriff (PDF)

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm

Journal of combinatorial theory. Series B, 2022-01, Vol.152, p.483-504

2022

Volltextzugriff (PDF)

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five

Journal of combinatorial theory. Series B, 2020-11, Vol.145, p.376-432

2020

Volltextzugriff (PDF)

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs

Journal of combinatorial theory. Series B, 2021-09, Vol.150, p.270-304

2021

Volltextzugriff (PDF)

A problem of Erdős and Sós on 3-graphs

Israel journal of mathematics, 2016-02, Vol.211 (1), p.349-366

2016

Volltextzugriff (PDF)

First order convergence of matroids

European journal of combinatorics, 2017-01, Vol.59, p.150-168

2017

Volltextzugriff (PDF)

Density Maximizers of Layered Permutations

The Electronic journal of combinatorics, 2022-09, Vol.29 (3)

2022

Volltextzugriff (PDF)

Cycles of a given length in tournaments

Journal of combinatorial theory. Series B, 2023-01, Vol.158, p.117-145

2023

Volltextzugriff (PDF)

Non-Three-Colourable Common Graphs Exist

Combinatorics, probability & computing, 2012-09, Vol.21 (5), p.734-742

2012

Volltextzugriff (PDF)

Non-Bipartite K-Common Graphs

Combinatorica (Budapest. 1981), 2022-02, Vol.42 (1), p.87-114

2022

Volltextzugriff (PDF)

Quasirandom Latin squares

Random structures & algorithms, 2022-09, Vol.61 (2), p.298-308

2022

Volltextzugriff (PDF)

Weak regularity and finitely forcible graph limits

Transactions of the American Mathematical Society, 2018-06, Vol.370 (6), p.3833-3864

2018

Volltextzugriff (PDF)

Quasirandom-Forcing Orientations of Cycles

SIAM journal on discrete mathematics, 2023-01, Vol.37 (4), p.2689-2716

2023

Volltextzugriff (PDF)

Toward characterizing locally common graphs

Random structures & algorithms, 2023-01, Vol.62 (1), p.181-218

2023

Volltextzugriff (PDF)

Walk entropy and walk-regularity

Linear algebra and its applications, 2018-06, Vol.546, p.115-121

2018

Volltextzugriff (PDF)

1 – 25 von 436

Menü

Weitere Dienste

Einstellungen

Planar graph with twin-width seven

Forcing generalised quasirandom graphs efficiently

A bound on the inducibility of cycles

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

Permutations with fixed pattern densities

Steinberg's Conjecture is false

Testing First-Order Properties for Subclasses of Sparse Graphs

Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations

On the number of pentagons in triangle-free graphs

Uniform Turán density of cycles

Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies

Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm

Three-coloring triangle-free graphs on surfaces III. Graphs of girth five

Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs

A problem of Erdős and Sós on 3-graphs

First order convergence of matroids

Density Maximizers of Layered Permutations

Cycles of a given length in tournaments

Non-Three-Colourable Common Graphs Exist

Non-Bipartite K-Common Graphs

Quasirandom Latin squares

Weak regularity and finitely forcible graph limits

Quasirandom-Forcing Orientations of Cycles

Toward characterizing locally common graphs

Walk entropy and walk-regularity

Suchergebnisse filtern