| Publication | Date of Publication | Type |
|---|
| The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree | 2023-11-27 | Paper |
| 3‐Degenerate induced subgraph of a planar graph | 2023-10-04 | Paper |
| Equitable list coloring of planar graphs with given maximum degree | 2023-09-02 | Paper |
| Improved upper bounds on longest-path and maximal-subdivision transversals | 2023-06-12 | Paper |
| Coloring number and on-line Ramsey theory for graphs and hypergraphs | 2022-06-29 | Paper |
| On the weak 2-coloring number of planar graphs | 2021-10-27 | Paper |
| Every planar graph is 1-defective \((9,2)\)-paintable | 2021-03-17 | Paper |
| Uniform orderings for generalized coloring numbers | 2021-02-08 | Paper |
| On coloring numbers of graph powers | 2020-04-21 | Paper |
| Improved lower bounds on the number of edges in list critical and online list critical graphs | 2020-01-15 | Paper |
| An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles | 2019-07-25 | Paper |
| Chromatic numbers of exact distance graphs | 2018-12-20 | Paper |
| An easy subexponential bound for online chain partitioning | 2018-05-25 | Paper |
| A Sharp Dirac–Erdős Type Bound for Large Graphs | 2018-04-23 | Paper |
| The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles | 2018-03-16 | Paper |
| Sharpening an ore-type version of the Corrádi-Hajnal theorem | 2018-01-05 | Paper |
| Extracting List Colorings from Large Independent Sets | 2017-12-01 | Paper |
| An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs | 2017-10-04 | Paper |
| Strengthening Theorems of Dirac and Erdős on Disjoint Cycles | 2017-08-10 | Paper |
| A refinement of a result of Corrádi and Hajnal | 2017-03-31 | Paper |
| On the Corrádi-Hajnal theorem and a question of Dirac | 2016-11-25 | Paper |
| On the choice number of complete multipartite graphs with part size four | 2016-08-16 | Paper |
| First-fit coloring on interval graphs has performance ratio at least 5 | 2015-09-30 | Paper |
| Edge coloring multigraphs without small dense subsets | 2015-08-05 | Paper |
| On choosability with separation of planar graphs with lists of different sizes | 2015-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173158 | 2015-02-09 | Paper |
| On directed versions of the Corrádi-Hajnal corollary | 2014-09-04 | Paper |
| Equitable list coloring of graphs with bounded degree | 2013-11-15 | Paper |
| A note on relaxed equitable coloring of graphs | 2013-04-04 | Paper |
| On First-Fit coloring of ladder-free posets | 2012-12-03 | Paper |
| Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring | 2012-09-12 | Paper |
| Adapted game colouring of graphs | 2012-05-04 | Paper |
| Pósa's conjecture for graphs of order at least 2 × 108 | 2012-04-24 | Paper |
| Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture | 2011-07-22 | Paper |
| A fast algorithm for equitable coloring | 2011-04-26 | Paper |
| First-fit coloring of bounded tolerance graphs | 2011-04-19 | Paper |
| 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees | 2011-04-15 | Paper |
| The Two-Coloring Number and Degenerate Colorings of Planar Graphs | 2010-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576661 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575431 | 2010-07-27 | Paper |
| Planar graphs are 1-relaxed, 4-choosable | 2010-06-17 | Paper |
| Toward a Hajnal-Szemeredi theorem for hypergraphs | 2010-05-21 | Paper |
| Efficient Graph Packing via Game Colouring | 2010-04-22 | Paper |
| Extremal graph packing problems: Ore-type versus Dirac-type | 2010-01-13 | Paper |
| Ore-type versions of Brooks' theorem | 2009-03-04 | Paper |
| Star coloring bipartite planar graphs | 2009-02-20 | Paper |
| A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring | 2008-07-21 | Paper |
| The Map-Coloring Game | 2008-03-20 | Paper |
| The game of arboricity | 2008-03-18 | Paper |
| Asymmetric marking games on line graphs | 2008-03-13 | Paper |
| An Ore-type theorem on equitable coloring | 2007-12-10 | Paper |
| Dominating sets in \(k\)-majority tournaments. | 2006-05-18 | Paper |
| Weak acyclic coloring and asymmetric coloring games | 2006-05-16 | Paper |
| Very asymmetric marking games | 2006-05-02 | Paper |
| Asymmetric graph coloring games | 2005-04-21 | Paper |
| Radius Three Trees in Graphs with Large Chromatic Number | 2005-02-28 | Paper |
| Explicit 2-factorizations of the odd graph | 2005-02-25 | Paper |
| Coloring with no 2-colored \(P_4\)'s | 2004-10-13 | Paper |
| On-line Ramsey theory | 2004-10-13 | Paper |
| A simple competitive graph coloring algorithm. III | 2004-10-01 | Paper |
| Orderings on graphs and game coloring number | 2004-08-06 | Paper |
| The relaxed game chromatic number of outerplanar graphs | 2004-08-06 | Paper |
| A simple competitive graph coloring algorithm. II. | 2004-03-15 | Paper |
| Marking games and the oriented game chromatic number of partial \(k\)-trees | 2003-07-08 | Paper |
| 2-factors in dense bipartite graphs | 2002-12-02 | Paper |
| A note on graph pebbling | 2002-07-29 | Paper |
| Spanning trees of bounded degree | 2001-12-11 | Paper |
| Competitive colorings of oriented graphs | 2001-10-16 | Paper |
| On the choosability of complete multipartite graphs with part size three | 2000-09-15 | Paper |
| Extending partial colorings of graphs | 2000-09-15 | Paper |
| A simple competitive graph coloring algorithm | 2000-06-25 | Paper |
| Interval orders and dimension | 2000-03-21 | Paper |
| Onk-ordered Hamiltonian graphs | 1999-11-23 | Paper |
| Hamiltonian chains in hypergraphs | 1999-11-03 | Paper |
| The dimension of two levels of the Boolean lattice | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249728 | 1999-06-17 | Paper |
| On-line coloring \(k\)-colorable graphs | 1999-03-18 | Paper |
| Square Hamiltonian cycles in graphs with maximal 4-cliques | 1998-06-22 | Paper |
| Classes of Graphs that Are Not Vertex Ramsey | 1998-02-09 | Paper |
| Classes of graphs that exclude a tree and a clique and are not vertex Ramsey | 1998-01-11 | Paper |
| On-line coloring of perfect graphs | 1998-01-11 | Paper |
| The dimension of the finite subsets of \(\kappa\) | 1997-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284095 | 1997-03-09 | Paper |
| Partitioning a graph into two square-cycles | 1996-12-16 | Paper |
| Hamiltonian square-paths | 1996-10-14 | Paper |
| Applications of hypergraph coloring to coloring graphs not inducing certain trees | 1996-09-01 | Paper |
| On-Line and First-fit Coloring of Graphs that Do Not Induce $P_5 $ | 1996-06-05 | Paper |
| Coloring interval graphs with First-Fit | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873750 | 1996-04-22 | Paper |
| On the order dimension of 1-sets versus \(k\)-sets | 1996-03-31 | Paper |
| The square of paths and cycles | 1995-07-02 | Paper |
| Radius two trees specify χ‐bounded classes | 1995-03-20 | Paper |
| The dimension of suborders of the Boolean lattice | 1994-11-27 | Paper |
| Radius two trees specify χ‐bounded classes | 1994-10-20 | Paper |
| An explicit 1-factorization in the middle of the Boolean lattice | 1994-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138289 | 1994-07-24 | Paper |
| On-Line Coloring and Recursive Graph Theory | 1994-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137197 | 1993-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201568 | 1993-08-25 | Paper |
| The dimension of cycle-free orders | 1993-06-29 | Paper |
| Colorful induced subgraphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010310 | 1992-09-27 | Paper |
| Fibres and ordered set coloring | 1992-06-26 | Paper |
| The dimension of random ordered sets | 1992-06-25 | Paper |
| A polynomial time approximation algorithm for dynamic storage allocation | 1992-06-25 | Paper |
| Hypergraphs With Finitely Many Isomorphism Subtypes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3495390 | 1989-01-01 | Paper |
| The number of depth-first searches of an ordered set | 1989-01-01 | Paper |
| Applications of edge coloring of multigraphs to vertex coloring of graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800614 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823418 | 1988-01-01 | Paper |
| The Linearity of First-Fit Coloring of Interval Graphs | 1988-01-01 | Paper |
| Explicit matchings in the middle levels of the Boolean lattice | 1988-01-01 | Paper |
| A minimax theorem for chain complete ordered sets | 1988-01-01 | Paper |
| On Π1-automorphisms of recursive linear orders | 1987-01-01 | Paper |
| A Ramsey theoretic problem for finite ordered sets | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4722060 | 1986-01-01 | Paper |
| NP-completeness results concerning greedy and super greedy linear extensions | 1986-01-01 | Paper |
| The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\) | 1986-01-01 | Paper |
| Inequalities for the greedy dimensions of ordered sets | 1985-01-01 | Paper |
| Degrees of Indiscernibles in Decidable Models | 1985-01-01 | Paper |
| A theory of recursive dimension of ordered sets | 1984-01-01 | Paper |
| On the chromatic index of multigraphs without large triangles | 1984-01-01 | Paper |
| A new method of proving theorems on chromatic index | 1984-01-01 | Paper |
| An Effective Version of Hall's Theorem | 1983-01-01 | Paper |
| Some applications of Vizing's theorem to vertex colorings of graphs | 1983-01-01 | Paper |
| Indiscernibles and decidable models | 1983-01-01 | Paper |
| An Effective Version of Dilworth's Theorem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950561 | 1981-01-01 | Paper |
| Recursive Colorings of Highly Recursive Graphs | 1981-01-01 | Paper |
| Countable models of ω1-categorical theories in admissible languages | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3205308 | 1979-01-01 | Paper |
