| Publication | Date of Publication | Type |
|---|
| Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result | 2023-10-09 | Paper |
| Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result | 2023-10-09 | Paper |
| Notes on tree- and path-chromatic number | 2021-12-10 | Paper |
| Tight bounds on the clique chromatic number | 2021-09-28 | Paper |
| Cops and robbers on oriented toroidal grids | 2021-01-25 | Paper |
| Tight Bounds on the Clique Chromatic Number | 2020-06-19 | Paper |
| A lower bound on the average degree forcing a minor | 2020-06-15 | Paper |
| A variant of the Erdős‐Sós conjecture | 2020-05-21 | Paper |
| Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs | 2020-04-07 | Paper |
| Notes on growing a tree in a graph | 2019-11-07 | Paper |
| Near-domination in graphs | 2019-06-25 | Paper |
| A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633816 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633933 | 2019-05-06 | Paper |
| A logarithmic bound for the chromatic number of the associahedron | 2018-11-21 | Paper |
| Polyhedral results on the stable set problem in graphs containing even or odd pairs | 2018-09-28 | Paper |
| How to determine if a random graph with a fixed degree sequence has a giant component | 2018-02-12 | Paper |
| Colourings with Bounded Monochromatic Components in Graphs of Given Circumference | 2017-12-06 | Paper |
| Forcing a sparse minor | 2017-10-10 | Paper |
| ‘Forcing a sparse minor’ — CORRIGENDUM | 2017-10-10 | Paper |
| Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree | 2017-10-10 | Paper |
| Building your path to escape from home | 2017-09-29 | Paper |
| Acyclic edge colourings of graphs with large girth | 2017-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816123 | 2016-07-01 | Paper |
| A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω | 2016-02-01 | Paper |
| The height of a random binary search tree | 2015-11-12 | Paper |
| Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time | 2015-09-25 | Paper |
| A Proof of a Conjecture of Ohba | 2015-05-22 | Paper |
| Excluding a Substar and an Antisubstar | 2015-05-20 | Paper |
| AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH | 2015-04-29 | Paper |
| Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ | 2015-03-24 | Paper |
| Colouring graphs when the number of colours is nearly the maximum degree | 2015-02-27 | Paper |
| Hadwiger's conjecture is decidable | 2015-02-04 | Paper |
| A linear-time algorithm to find a separator in a graph excluding a minor | 2014-11-18 | Paper |
| For most graphs H , most H -free graphs have a linear homogeneous set | 2014-11-17 | Paper |
| Colouring graphs when the number of colours is almost the maximum degree | 2014-10-22 | Paper |
| A Density Version of the Corradi-Hajnal Theorem | 2014-10-01 | Paper |
| How tall is a tree? | 2014-09-26 | Paper |
| Removable paths and cycles with parity constraints | 2014-08-28 | Paper |
| Odd cycle packing | 2014-08-13 | Paper |
| The Graph Minor Algorithm with Parity Conditions | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417627 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417631 | 2014-05-22 | Paper |
| A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph | 2014-04-10 | Paper |
| Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time | 2013-10-10 | Paper |
| A general critical condition for the emergence of a giant component in random graphs with given degrees | 2013-10-10 | Paper |
| Digraph Girth via Chromatic Number | 2013-09-26 | Paper |
| Asymptotics of the chromatic number for quasi-line graphs | 2013-07-31 | Paper |
| A Characterization of Graphs with Fractional Total Chromatic Number Equal to | 2013-07-19 | Paper |
| Oriented trees in digraphs | 2013-04-15 | Paper |
| Connectivity for Bridge-Addable Monotone Graph Classes | 2012-10-31 | Paper |
| Griggs and Yeh's Conjecture and $L(p,1)$-labelings | 2012-08-22 | Paper |
| Polynomial-time recognition of clique-width \(\leq 3\) graphs | 2012-05-11 | Paper |
| The disjoint paths problem in quadratic time | 2012-05-04 | Paper |
| Polynomial treewidth forces a large grid-like-minor | 2012-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3078209 | 2011-02-18 | Paper |
| The edge-density for \(K_{2,t}\) minors | 2011-01-14 | Paper |
| Critical random graphs and the structure of a minimum spanning tree | 2010-11-09 | Paper |
| Highly parity linked graphs | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579485 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579493 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576658 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576679 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574996 | 2010-07-05 | Paper |
| Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph | 2010-05-25 | Paper |
| Tree-width of graphs without a \(3\times 3\) grid minor | 2010-04-28 | Paper |
| Asymptotically optimal frugal colouring | 2010-04-21 | Paper |
| Corrigendum to ``Asymptotically optimal frugal colouring [J. Comb. Theory, Ser. B 100, No. 2, 226--246 (2010)] | 2010-04-21 | Paper |
| Minima in branching random walks | 2009-07-28 | Paper |
| Coloring Artemis graphs | 2009-05-28 | Paper |
| On Planar Quasi-Parity Graphs | 2009-03-16 | Paper |
| Bounding χ in terms of ω and Δ for quasi-line graphs | 2009-02-20 | Paper |
| Properly 2-Colouring Linear Hypergraphs | 2009-02-17 | Paper |
| On the odd-minor variant of Hadwiger's conjecture | 2009-01-21 | Paper |
| Removable cycles in non-bipartite graphs | 2009-01-21 | Paper |
| Fast Skew Partition Recognition | 2009-01-13 | Paper |
| Domination in Cubic Graphs of Large Girth | 2009-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549636 | 2009-01-05 | Paper |
| Bisimplicial vertices in even-hole-free graphs | 2008-12-08 | Paper |
| A weaker version of Lovász' path removal conjecture | 2008-10-07 | Paper |
| Partition into cliques for cubic graphs: Planar case, complexity and approximation | 2008-09-29 | Paper |
| On the Maximum Degree of a Random Planar Graph | 2008-09-29 | Paper |
| The evolution of the mixing rate of a simple random walk on the giant component of a random graph | 2008-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3509398 | 2008-07-01 | Paper |
| Asymptotics of the chromatic number for quasi-line graphs | 2008-06-05 | Paper |
| List Colouring Squares of Planar Graphs | 2008-06-05 | Paper |
| List Colouring Constants of Triangle Free Graphs | 2008-06-05 | Paper |
| Fractionally total colouring \(G_{n,p}\) | 2008-04-16 | Paper |
| Skew partitions in perfect graphs | 2008-04-16 | Paper |
| Degree constrained subgraphs | 2008-04-16 | Paper |
| Planar graph bipartization in linear time | 2008-04-16 | Paper |
| Optimization and Recognition for K 5-minor Free Graphs in Linear Time | 2008-04-15 | Paper |
| Fractional coloring and the odd Hadwiger's conjecture | 2008-02-25 | Paper |
| Ballot theorems for random walks with finite variance | 2008-02-18 | Paper |
| Vertex-colouring edge-weightings | 2008-01-14 | Paper |
| An upper bound for the chromatic number of line graphs | 2007-11-21 | Paper |
| The Erdős-Pósa property for long circuits | 2007-11-12 | Paper |
| Approximate Min-max Relations for Odd Cycles in Planar Graphs | 2007-08-30 | Paper |
| Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) | 2007-07-19 | Paper |
| Bull-Reducible Berge Graphs are Perfect | 2007-05-29 | Paper |
| A note on Random Homomorphism from ArbitraryGraphs to Z | 2007-05-29 | Paper |
| Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439691 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439692 | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439696 | 2007-05-29 | Paper |
| Approximate min-max relations for odd cycles in planar graphs | 2007-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424767 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424900 | 2007-03-05 | Paper |
| Concentration for self-bounding functions and an inequality of Talagrand | 2007-02-07 | Paper |
| Faster mixing and small bottlenecks | 2007-01-26 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| On the Co-P3 -Structure of Perfect Graphs | 2005-09-16 | Paper |
| On the fractional chromatic index of a graph and its complement | 2005-08-25 | Paper |
| Vertex colouring edge partitions | 2005-08-05 | Paper |
| List colouring when the chromatic number is close to the order of the graph | 2005-07-05 | Paper |
| The perfection and recognition of bull-reducible Berge graphs | 2005-06-07 | Paper |
| (\(\Delta-k\))-critical graphs | 2005-03-08 | Paper |
| Star coloring of graphs | 2005-02-16 | Paper |
| Finding odd cycle transversals. | 2005-01-11 | Paper |
| Stable skew partition problem | 2004-11-23 | Paper |
| Hadwiger's conjecture for line graphs | 2004-10-04 | Paper |
| Excluding any graph as a minor allows a low tree-width 2-coloring | 2004-08-06 | Paper |
| Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448754 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542572 | 2004-01-27 | Paper |
| A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) | 2004-01-05 | Paper |
| Channel assignment on graphs of bounded treewidth | 2004-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428907 | 2003-09-22 | Paper |
| Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity | 2003-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407447 | 2003-01-01 | Paper |
| Asymptotically the list colouring constants are 1 | 2002-12-10 | Paper |
| Random Regular Graphs of Non-Constant Degree: Independence and Chromatic Number | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4549228 | 2002-11-07 | Paper |
| Recognizing planar strict quasi-parity graphs | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2758333 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508373 | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2758331 | 2002-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242948 | 2002-03-04 | Paper |
| The Erdős-Pósa property for odd cycles in highly connected graphs | 2002-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768325 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741376 | 2001-09-23 | Paper |
| Graph colouring and the probabilistic method | 2001-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508369 | 2001-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489192 | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2758340 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4521527 | 2000-12-19 | Paper |
| Near-optimal list colorings | 2000-12-19 | Paper |
| Channel assignment and weighted coloring | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944974 | 2000-10-08 | Paper |
| Fractional colouring and Hadwiger's conjecture | 2000-06-25 | Paper |
| Clique minors in graphs and their complements | 2000-06-25 | Paper |
| A description of claw-free perfect graphs | 2000-04-04 | Paper |
| Optimal packings of edge-disjoint odd cycles | 2000-03-19 | Paper |
| Critical subgraphs of a random graph | 2000-01-16 | Paper |
| Mangoes and blueberries | 1999-12-20 | Paper |
| A strengthening of Brooks' theorem | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250147 | 1999-11-08 | Paper |
| Colouring proximity graphs in the plane | 1999-11-03 | Paper |
| A bound on the total chromatic number | 1999-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4229265 | 1999-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224932 | 1999-08-17 | Paper |
| The Size of the Giant Component of a Random Graph with a Given Degree Sequence | 1999-07-19 | Paper |
| Edge-disjoint odd cycles in graphs with small chromatic numbers | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4248539 | 1999-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840353 | 1999-04-08 | Paper |
| Colouring a graph frugally | 1999-03-14 | Paper |
| Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors | 1999-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226449 | 1999-01-27 | Paper |
| Edge coloring nearly bipartite graphs | 1999-01-01 | Paper |
| Edge coloring regular graphs of high degree | 1998-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352948 | 1998-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839005 | 1998-08-13 | Paper |
| Path parity and perfection | 1998-01-12 | Paper |
| Packing directed circuits | 1998-01-11 | Paper |
| The Gallai-Younger conjecture for planar graphs | 1998-01-07 | Paper |
| An algorithm for finding homogeneous pairs | 1997-11-09 | Paper |
| On planar perfectly contractile graphs | 1997-09-19 | Paper |
| A bound on the strong chromatic index of a graph | 1997-05-05 | Paper |
| Paths, Stars and the Number Three | 1997-03-06 | Paper |
| Perfect Matchings in Random r-regular, s-uniform Hypergraphs | 1997-03-06 | Paper |
| On the Variance of the Height of Random Binary Search Trees | 1996-09-15 | Paper |
| Covering the edges of a random graph by cliques | 1996-06-05 | Paper |
| When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? | 1996-03-18 | Paper |
| Recognizing bull-free perfect graphs | 1996-02-20 | Paper |
| Almost Every Graph can be Covered by Linear Forests | 1996-02-12 | Paper |
| A critical point for random graphs with a given degree sequence | 1995-10-23 | Paper |
| The dominating number of a random cubic graph | 1995-10-17 | Paper |
| Multicoloured Hamilton cycles | 1995-05-22 | Paper |
| Rooted routing in the plane | 1995-04-10 | Paper |
| Fractionally colouring total graphs | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273841 | 1994-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4280136 | 1994-06-26 | Paper |
| Complete multi-partite cutsets in minimal imperfect graphs | 1994-05-05 | Paper |
| The Strongly Connected Components of 1-in, 1-out | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273851 | 1994-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273842 | 1994-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137198 | 1993-11-07 | Paper |
| Polychromatic Hamilton cycles | 1993-10-17 | Paper |
| Star arboricity | 1993-03-10 | Paper |
| On total colourings of graphs | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014322 | 1992-10-06 | Paper |
| Linear arboricity of random regular graphs | 1992-06-25 | Paper |
| Acyclic coloring of graphs | 1992-06-25 | Paper |
| Greedy Matching on the Line | 1990-01-01 | Paper |
| \(P_ 4\)-comparability graphs | 1989-01-01 | Paper |
| Some classes of perfectly orderable graphs | 1989-01-01 | Paper |
| Building heaps fast | 1989-01-01 | Paper |
| Edge-colouring random graphs | 1988-01-01 | Paper |
| A note on even pairs | 1988-01-01 | Paper |
| Threshold tolerance graphs | 1988-01-01 | Paper |
| A note on short cycles in digraphs | 1987-01-01 | Paper |
| A semi-strong perfect graph theorem | 1987-01-01 | Paper |
| A note on even pairs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789612 | 1986-01-01 | Paper |
| A note on the semi-strong perfect graph conjecture | 1985-01-01 | Paper |
