Publication | Date of Publication | Type |
---|
Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations | 2024-01-29 | Paper |
Quasirandom-Forcing Orientations of Cycles | 2023-11-29 | Paper |
Closure property of contraction-depth of matroids | 2023-11-03 | Paper |
The dimension of the region of feasible tournament profiles | 2023-10-30 | Paper |
Quasirandom Latin squares | 2023-10-17 | Paper |
Toward characterizing locally common graphs | 2023-10-17 | Paper |
Uniform Turán density of cycles | 2023-07-10 | Paper |
Forcing Generalized Quasirandom Graphs Efficiently | 2023-03-07 | Paper |
No additional tournaments are quasirandom-forcing | 2022-12-01 | Paper |
Cycles of a given length in tournaments | 2022-11-23 | Paper |
Inducibility and universality for trees | 2022-11-23 | Paper |
Density maximizers of layered permutations | 2022-10-06 | Paper |
Planar graph with twin-width seven | 2022-09-23 | Paper |
Non-bipartite \(k\)-common graphs | 2022-06-30 | Paper |
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming | 2022-06-08 | Paper |
Packing and covering directed triangles asymptotically | 2022-01-13 | Paper |
Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm | 2021-11-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q5005129 | 2021-08-04 | Paper |
Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies | 2021-07-06 | Paper |
Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs | 2021-07-06 | Paper |
Coloring graphs by translates in the circle | 2021-06-18 | Paper |
Elusive extremal graphs | 2021-05-10 | Paper |
Cyclic coloring of plane graphs with maximum face size 16 and 17 | 2021-04-14 | Paper |
Analytic representations of large graphs | 2021-02-06 | Paper |
Characterization of quasirandom permutations by a pattern sum | 2021-01-05 | Paper |
Finitely forcible graphons with an almost arbitrary structure | 2020-10-20 | Paper |
Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five | 2020-09-24 | Paper |
Cycles of length three and four in tournaments | 2020-07-03 | Paper |
Permutations with fixed pattern densities | 2020-06-19 | Paper |
Non-bipartite k-common graphs | 2020-06-16 | Paper |
Hadwiger meets Cayley | 2020-05-12 | Paper |
Decomposing Graphs into Edges and Triangles | 2020-04-06 | Paper |
Compactness and finite forcibility of graphons | 2019-10-15 | Paper |
Hereditary properties of permutations are strongly testable | 2019-06-20 | Paper |
More non-bipartite forcing pairs | 2019-06-10 | Paper |
Packing directed cycles through a specified vertex set | 2019-05-15 | Paper |
Infinite‐dimensional finitely forcible graphon | 2019-05-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4633818 | 2019-05-06 | Paper |
Optimal‐size clique transversals in chordal graphs | 2019-01-03 | Paper |
The step Sidorenko property and non-norming edge-transitive graphs | 2018-12-19 | Paper |
A bound on the inducibility of cycles | 2018-11-08 | Paper |
Finitely forcible graph limits are universal | 2018-11-08 | Paper |
Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk | 2018-07-24 | Paper |
Graphic TSP in cubic graphs | 2018-04-19 | Paper |
Walk entropy and walk-regularity | 2018-04-12 | Paper |
Weak regularity and finitely forcible graph limits | 2018-03-28 | Paper |
Counting flags in triangle-free digraphs | 2018-03-16 | Paper |
Extremal graph theory and finite forcibility | 2018-01-18 | Paper |
First-Order Convergence and Roots | 2017-10-10 | Paper |
Recovering sparse graphs | 2017-09-28 | Paper |
First order limits of sparse graphs: Plane trees and path-width | 2017-08-10 | Paper |
Steinberg's conjecture is false | 2016-11-25 | Paper |
Densities in large permutations and parameter testing | 2016-11-07 | Paper |
Third case of the cyclic coloring conjecture | 2016-10-14 | Paper |
Weak regularity and finitely forcible graph limits | 2016-10-14 | Paper |
First order convergence of matroids | 2016-10-12 | Paper |
Densities of 3-vertex graphs | 2016-10-07 | Paper |
Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. | 2016-06-03 | Paper |
A problem of Erdős and Sós on 3-graphs | 2016-04-21 | Paper |
Third Case of the Cyclic Coloring Conjecture | 2016-04-04 | Paper |
FO Model Checking of Interval Graphs | 2016-01-07 | Paper |
Packing six \(T\)-joins in plane graphs | 2015-12-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501275 | 2015-08-03 | Paper |
Rank of divisors on tropical curves | 2015-06-19 | Paper |
Finitely forcible graphons and permutons | 2014-11-21 | Paper |
Extensions of fractional precolorings show discontinuous behavior | 2014-11-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2921752 | 2014-10-13 | Paper |
The fractional chromatic number of triangle-free subcubic graphs | 2014-07-29 | Paper |
A problem of Erdős and Sós on 3-graphs | 2014-06-11 | Paper |
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs | 2014-04-25 | Paper |
Testing first-order properties for subclasses of sparse graphs | 2014-02-17 | Paper |
Cubic bridgeless graphs have more than a linear number of perfect matchings | 2013-10-10 | Paper |
Circular edge-colorings of cubic graphs with girth six | 2013-10-10 | Paper |
Counting flags in triangle-free digraphs | 2013-10-10 | Paper |
FO Model Checking of Interval Graphs | 2013-08-07 | Paper |
Six-Critical Graphs on the Klein Bottle | 2013-06-28 | Paper |
Quasirandom permutations are characterized by 4-point densities | 2013-06-25 | Paper |
A New Bound for the 2/3 Conjecture | 2013-05-13 | Paper |
On the number of pentagons in triangle-free graphs | 2013-03-06 | Paper |
Min-Max Relations for Odd Cycles in Planar Graphs | 2013-01-04 | Paper |
Coloring Eulerian triangulations of the Klein bottle | 2012-12-27 | Paper |
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs | 2012-12-14 | Paper |
On the removal lemma for linear systems over abelian groups | 2012-12-03 | Paper |
A removal lemma for systems of linear equations over finite fields | 2012-11-19 | Paper |
Deciding First Order Properties of Matroids | 2012-11-01 | Paper |
A new lower bound based on Gromov's method of selecting heavily covered points | 2012-09-19 | Paper |
Extending Fractional Precolorings | 2012-09-12 | Paper |
Non-Three-Colourable Common Graphs Exist | 2012-09-12 | Paper |
Decomposition width of matroids | 2012-05-11 | Paper |
Classes of graphs with small rank decompositions are \(\chi \)-bounded | 2012-05-04 | Paper |
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs | 2012-05-04 | Paper |
Fractional colorings of cubic graphs with large girth | 2012-03-15 | Paper |
Cyclic colorings of plane graphs with independent faces | 2012-02-11 | Paper |
Domination number of cubic graphs with large girth | 2012-02-08 | Paper |
Fractional total colourings of graphs of high girth | 2011-12-08 | Paper |
Limit Behavior of Locally Consistent Constraint Satisfaction Problems | 2011-10-27 | Paper |
Exponentially many perfect matchings in cubic graphs | 2011-07-25 | Paper |
The Last Fraction of a Fractional Conjecture | 2011-04-15 | Paper |
Triangles in arrangements of points and lines in the plane | 2011-04-11 | Paper |
Short Cycle Covers of Graphs with Minimum Degree Three | 2011-03-15 | Paper |
Equipartite polytopes | 2010-12-06 | Paper |
Coloring plane graphs with independent crossings | 2010-11-10 | Paper |
Graphs with bounded tree-width and large odd-girth are almost bipartite | 2010-11-05 | Paper |
Brooks' theorem via the Alon-Tarsi theorem | 2010-10-28 | Paper |
Decomposition Width of Matroids | 2010-09-07 | Paper |
Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs | 2010-08-27 | Paper |
A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs | 2010-08-27 | Paper |
Markov bases of binary graph models of \(K_{4}\)-minor free graphs | 2010-08-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576657 | 2010-07-30 | Paper |
An improved linear bound on the number of perfect matchings in cubic graphs | 2010-06-17 | Paper |
Circular edge-colorings of cubic graphs with girth six | 2010-06-03 | Paper |
Distance constrained labelings of planar graphs with no short cycles | 2010-04-28 | Paper |
Graph labellings with variable weights, a survey | 2010-04-28 | Paper |
Facial colorings using Hall's theorem | 2010-04-27 | Paper |
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs | 2010-04-22 | Paper |
Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs | 2010-03-31 | Paper |
Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs | 2010-03-29 | Paper |
A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) | 2010-03-26 | Paper |
Chromatic number for a generalization of Cartesian product graphs | 2010-03-26 | Paper |
Pattern hypergraphs | 2010-03-26 | Paper |
Matchings and Nonrainbow Colorings | 2010-03-17 | Paper |
6-Critical Graphs on the Klein Bottle | 2010-03-17 | Paper |
Algorithms for Classes of Graphs with Bounded Expansion | 2010-01-21 | Paper |
Distance constrained labelings of \(K_{4}\)-minor free graphs | 2009-12-15 | Paper |
A note on antisymmetric flows in graphs | 2009-12-01 | Paper |
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice | 2009-11-27 | Paper |
Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice | 2009-09-18 | Paper |
Fullerene graphs have exponentially many perfect matchings | 2009-09-02 | Paper |
Long cycles in fullerene graphs | 2009-09-02 | Paper |
A combinatorial proof of the removal lemma for groups | 2009-06-17 | Paper |
Hamiltonian threshold for strong products of graphs | 2009-06-04 | Paper |
Coloring of Triangle-Free Graphs on the Double Torus | 2009-05-27 | Paper |
Randomized strategies for the plurality problem | 2009-03-04 | Paper |
List colorings with measurable sets | 2009-02-20 | Paper |
Equipartite graphs | 2009-02-17 | Paper |
Projective, affine, and abelian colorings of cubic graphs | 2009-01-27 | Paper |
Coloring even-faced graphs in the torus and the Klein bottle | 2008-10-21 | Paper |
Labelings of Graphs with Fixed and Variable Edge-Weights | 2008-08-13 | Paper |
Characterization of affine Steiner triple systems and Hall triple systems | 2008-06-05 | Paper |
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems | 2008-06-05 | Paper |
Coloring Triangle-Free Graphs on Surfaces | 2008-05-27 | Paper |
Coloring squares of planar graphs with girth six | 2008-05-13 | Paper |
Tough spiders | 2008-01-04 | Paper |
Hamilton cycles in prisms | 2008-01-04 | Paper |
Labeling planar graphs with a condition at distance two | 2007-11-21 | Paper |
The Channel Assignment Problem with Variable Weights | 2007-09-06 | Paper |
Computing Representations of Matroids of Bounded Branch-Width | 2007-09-03 | Paper |
Cyclic, diagonal and facial colorings -- a missing case | 2007-07-27 | Paper |
Unions of perfect matchings in cubic graphs | 2007-05-29 | Paper |
Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs | 2007-05-29 | Paper |
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings | 2007-05-22 | Paper |
Closure for the property of having a hamiltonian prism | 2007-03-20 | Paper |
The circular chromatic index of flower snarks | 2007-03-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3424884 | 2007-03-05 | Paper |
Mixed hypergraphs and other coloring problems | 2007-03-02 | Paper |
Probabilistic strategies for the partition and plurality problems | 2007-02-07 | Paper |
The circular chromatic index of graphs of high girth | 2007-01-11 | Paper |
Colorings of planar graphs with no rainbow faces | 2007-01-08 | Paper |
Eulerian colorings and the bipartizing matchings conjecture of Fleischner | 2006-11-15 | Paper |
Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\) | 2006-09-28 | Paper |
List coloring of Cartesian products of graphs | 2006-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5488104 | 2006-09-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5480727 | 2006-08-03 | Paper |
A Brooks-Type Theorem for the Generalized List T-Coloring | 2006-06-01 | Paper |
The last excluded case of Dirac's map‐color theorem for choosability | 2006-05-16 | Paper |
Coloring mixed hypertrees | 2006-04-28 | Paper |
Group coloring is \(\Pi_2^{\text{P}}\)-complete | 2006-03-20 | Paper |
Extending partial 5-colorings and 6-colorings in planar graphs | 2006-01-10 | Paper |
Locally consistent constraint satisfaction problems | 2006-01-09 | Paper |
STACS 2005 | 2005-12-02 | Paper |
A note on group colorings | 2005-11-07 | Paper |
Coloring Powers of Chordal Graphs | 2005-09-16 | Paper |
Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
Automata, Languages and Programming | 2005-08-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q5466086 | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
Coloring graphs from lists with bounded size of their union | 2005-08-01 | Paper |
Hamilton cycles in strong products of graphs | 2005-05-04 | Paper |
Cyclic, diagonal and facial colorings | 2005-03-08 | Paper |
An exact algorithm for the channel assignment problem | 2005-02-22 | Paper |
Coloring face hypergraphs on surfaces | 2005-01-11 | Paper |
Pancyclicity of strong products of graphs | 2004-12-13 | Paper |
Hajós' theorem for list coloring | 2004-11-18 | Paper |
It is tough to be a plumber | 2004-10-27 | Paper |
On feasible sets of mixed hypergraphs | 2004-10-13 | Paper |
Borodin's conjecture on diagonal coloring is false | 2004-10-04 | Paper |
A revival of the girth conjecture | 2004-10-01 | Paper |
Mixed hypercacti | 2004-10-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3043724 | 2004-08-06 | Paper |
Edge-disjoint odd cycles in planar graphs. | 2004-03-15 | Paper |
On maximum face-constrained coloring of plane graphs with no short face cycles. | 2004-03-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4448764 | 2004-02-18 | Paper |
A Theorem about the Channel Assignment Problem | 2004-01-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4405654 | 2003-09-05 | Paper |
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. | 2003-08-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4414494 | 2003-07-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4708589 | 2003-06-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4782746 | 2002-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4779166 | 2002-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4536383 | 2002-11-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766689 | 2002-07-09 | Paper |
On planar mixed hypergraphs | 2001-12-11 | Paper |