| Publication | Date of Publication | Type |
|---|
| Criticality in Sperner's lemma | 2025-01-14 | Paper |
| Graphs of low average degree without independent transversals | 2023-10-06 | Paper |
| The Hamiltonicity of essentially 9‐connected line graphs | 2023-09-29 | Paper |
| Fan's lemma via bistellar moves | 2023-08-14 | Paper |
| Packing $T$-connectors in graphs needs more connectivity | 2023-08-14 | Paper |
| Criticality in Sperner's Lemma | 2023-01-09 | Paper |
| Quasigraphs and skeletal partitions | 2022-10-07 | Paper |
| Rainbow bases in matroids | 2022-06-21 | Paper |
| Hamilton cycles in line graphs of 3-hypergraphs | 2022-06-14 | Paper |
| Edge-critical subgraphs of Schrijver graphs. II: The general case | 2021-11-17 | Paper |
| Edge-critical subgraphs of Schrijver graphs | 2020-07-07 | Paper |
| Shorter signed circuit covers of graphs | 2019-10-31 | Paper |
| Decomposing planar cubic graphs | 2018-08-16 | Paper |
| Planar graphs have two-coloring number at most 8 | 2018-04-18 | Paper |
| Weak regularity and finitely forcible graph limits | 2018-03-28 | Paper |
| Schrijver Graphs and Projective Quadrangulations | 2018-02-26 | Paper |
| Fractional covers and matchings in families of weighted \(d\)-intervals | 2018-02-12 | Paper |
| On the impulsiveness of multiuser interferences in TH-PPM-UWB systems | 2017-10-30 | Paper |
| Nowhere-zero flows in signed graphs: A survey | 2017-09-04 | Paper |
| First order limits of sparse graphs: Plane trees and path-width | 2017-08-10 | Paper |
| Treelike snarks | 2016-12-06 | Paper |
| 10-tough chordal graphs are Hamiltonian | 2016-11-25 | Paper |
| Weak regularity and finitely forcible graph limits | 2016-10-14 | Paper |
| 10-tough chordal graphs are Hamiltonian (extended abstract) | 2016-10-14 | Paper |
| Nowhere-zero flows in signed series-parallel graphs | 2016-06-23 | Paper |
| Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs | 2015-07-23 | Paper |
| 10-Gabriel graphs are Hamiltonian | 2015-07-15 | Paper |
| Colouring quadrangulations of projective spaces | 2015-06-10 | Paper |
| The fractional chromatic number of triangle-free subcubic graphs | 2014-07-29 | Paper |
| The Distance-t Chromatic Index of Graphs | 2014-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5413907 | 2014-05-02 | Paper |
| Replication in critical graphs and the persistence of monomial ideals | 2014-01-31 | Paper |
| Limits of near-coloring of sparse graphs | 2014-01-28 | Paper |
| On 1-Hamilton-connected claw-free graphs | 2014-01-27 | Paper |
| The rainbow connection number of 2-connected graphs | 2013-12-06 | Paper |
| Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs | 2013-12-06 | Paper |
| Hamilton cycles in 6-connected claw-free graphs (extended abstract) | 2013-10-10 | Paper |
| Multiple Petersen subdivisions in permutation graphs | 2013-06-07 | Paper |
| Star subdivisions and connected even factors in the square of a graph | 2012-08-10 | Paper |
| A Dirac theorem for trestles | 2012-06-18 | Paper |
| A short proof of the tree-packing theorem | 2012-05-30 | Paper |
| Hamilton cycles in 5-connected line graphs | 2012-05-04 | Paper |
| Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable | 2012-03-15 | Paper |
| On the 2-Resonance of Fullerenes | 2012-03-15 | Paper |
| Covering a Graph by Forests and a Matching | 2012-03-15 | Paper |
| Fractional total colourings of graphs of high girth | 2011-12-08 | Paper |
| Short Cycle Covers of Graphs with Minimum Degree Three | 2011-03-15 | Paper |
| Equipartite polytopes | 2010-12-06 | Paper |
| Disjoint Hamilton cycles in the star graph | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576709 | 2010-07-30 | Paper |
| Perfect matchings with restricted intersection in cubic graphs | 2010-06-17 | Paper |
| Minors of simplicial complexes | 2010-04-28 | Paper |
| A note on edge-colourings avoiding rainbow \(K_{4}\) and monochromatic \(K_{m}\) | 2010-03-26 | Paper |
| On a Rado type problem for homogeneous second order linear recurrences | 2010-03-26 | Paper |
| A note on antisymmetric flows in graphs | 2009-12-01 | Paper |
| Cycles Intersecting Edge-Cuts of Prescribed Sizes | 2009-08-20 | Paper |
| Equipartite graphs | 2009-02-17 | Paper |
| Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks | 2009-01-28 | Paper |
| DisjointT-paths in tough graphs | 2008-10-08 | Paper |
| Neighborhood unions and extremal spanning trees | 2008-05-13 | Paper |
| Hamilton cycles in prisms | 2008-01-04 | Paper |
| Tough spiders | 2008-01-04 | Paper |
| T‐joins intersecting small edge‐cuts in graphs | 2008-01-04 | Paper |
| Short disjoint paths in locally connected graphs | 2007-12-10 | Paper |
| A note on \(k\)-walks in bridgeless graphs | 2007-09-10 | Paper |
| Non-intersecting perfect matchings in cubic graphs (Extended abstract) | 2007-05-29 | Paper |
| Unions of perfect matchings in cubic graphs | 2007-05-29 | Paper |
| Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424884 | 2007-03-05 | Paper |
| The circular chromatic index of graphs of high girth | 2007-01-11 | Paper |
| Eulerian colorings and the bipartizing matchings conjecture of Fleischner | 2006-11-15 | Paper |
| A note on interconnecting matchings in graphs | 2006-10-19 | Paper |
| On the pancyclicity of lexicographic products | 2006-06-16 | Paper |
| The prism over the middle-levels graph is Hamiltonian | 2006-05-02 | Paper |
| Hourglasses and Hamilton cycles in 4‐connected claw‐free graphs | 2005-05-04 | Paper |
| A revival of the girth conjecture | 2004-10-01 | Paper |
| Hamiltonian decompositions of prisms over cubic graphs | 2004-10-01 | Paper |
| Planar graph colorings without short monochromatic cycles | 2004-08-06 | Paper |
| On growth rates of closed permutation classes | 2003-05-07 | Paper |
| Line transversals to unit disks | 2002-12-01 | Paper |
| Transversals of \(d\)-intervals | 1998-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4884918 | 1996-08-20 | Paper |
| Hypertree shrinking avoiding low degree vertices | N/A | Paper |
