| Publication | Date of Publication | Type |
|---|
| Brooks' Theorem | 2024-03-19 | Paper |
| Generalized DP-colorings of graphs | 2023-11-27 | Paper |
| Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$ | 2023-10-05 | Paper |
| Partitions of hypergraphs under variable degeneracy constraints | 2023-09-29 | Paper |
| Point partition numbers: decomposable and indecomposable critical graphs | 2022-05-27 | Paper |
| On DP‐coloring of digraphs | 2022-03-31 | Paper |
| Point partition numbers: perfect graphs | 2022-03-15 | Paper |
| Digraphs and Variable Degeneracy | 2022-03-15 | Paper |
| Coloring hypergraphs of low connectivity | 2022-02-03 | Paper |
| Vertex partition of hypergraphs and maximum degenerate subhypergraphs | 2021-09-06 | Paper |
| The minimum number of edges in 4-critical digraphs of given order | 2020-04-30 | Paper |
| Hajós and Ore constructions for digraphs | 2020-03-30 | Paper |
| Graph edge coloring: a survey | 2019-03-21 | Paper |
| Partitions of multigraphs under minimum degree constraints | 2019-03-11 | Paper |
| On DP-Coloring of Digraphs | 2018-12-23 | Paper |
| A Brooks type theorem for the maximum local edge connectivity | 2018-05-25 | Paper |
| In memoriam: Horst Sachs (1927--2016) | 2017-09-05 | Paper |
| A Relaxed Version of the Erdős–Lovász Tihany Conjecture | 2017-06-30 | Paper |
| Degree choosable signed graphs | 2017-02-27 | Paper |
| Brook's theorem | 2016-09-30 | Paper |
| List-colourings | 2016-09-30 | Paper |
| Decomposable and indecomposable critical hypergraphs | 2016-05-25 | Paper |
| Orientations of graphs with prescribed weighted out-degrees | 2015-01-20 | Paper |
| The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) | 2012-12-27 | Paper |
| Graphs with chromatic number close to maximum degree | 2012-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118960 | 2012-03-06 | Paper |
| Ohba's conjecture for graphs with independence number five | 2011-05-16 | Paper |
| Vizing's coloring algorithm and the fan number | 2010-11-10 | Paper |
| Graphs with bounded tree-width and large odd-girth are almost bipartite | 2010-11-05 | Paper |
| A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs | 2010-08-27 | Paper |
| Edge colouring by total labellings | 2010-03-29 | Paper |
| On Vizing's bound for the chromatic index of a multigraph | 2009-12-15 | Paper |
| On list critical graphs | 2009-12-15 | Paper |
| The Erdős-Lovász tihany conjecture for quasi-line graphs | 2009-12-09 | Paper |
| A list version of Dirac's theorem on the number of edges in colour-critical graphs | 2009-12-08 | Paper |
| Partitions and edge colourings of multigraphs | 2009-04-07 | Paper |
| Ordered and linked chordal graphs | 2009-02-26 | Paper |
| List colorings with measurable sets | 2009-02-20 | Paper |
| A map colour theorem for the union of graphs | 2006-01-10 | Paper |
| Nordhaus–Gaddum‐type Theorems for decompositions into many parts | 2005-12-08 | Paper |
| Deeply asymmetric planar graphs | 2005-09-28 | Paper |
| On a special case of Hadwiger's conjecture | 2004-10-27 | Paper |
| Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs | 2004-03-29 | Paper |
| A new lower bound on the number of edges in colour-critical graphs and hypergraphs | 2003-08-25 | Paper |
| On the number of edges in colour-critical graphs and hypergraphs | 2001-06-13 | Paper |
| Colour-critical graphs with few edges | 2000-11-02 | Paper |
| Dirac's map-color theorem for choosability | 2000-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250145 | 2000-01-09 | Paper |
| The colour theorems of Brooks and Gallai extended | 1997-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4715286 | 1997-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5689006 | 1997-03-11 | Paper |
| An abstract generalization of a map reduction theorem of Birkhoff | 1996-02-22 | Paper |
| On Colouring Partial Joins of a Complete Graph and a Cycle | 1994-08-21 | Paper |
| The forest plus stars colouring problem | 1994-04-04 | Paper |
| On Hadwiger's number---A problem of the Nordhaus-Gaddum type | 1993-01-16 | Paper |
| A solution to a colouring problem of P. Erdős | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4018353 | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750883 | 1990-01-01 | Paper |
| On constructive methods in the theory of colour-critical graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3822189 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789506 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204168 | 1988-01-01 | Paper |
| \(K_ 5\) is the only double-critical 5-chromatic graph | 1987-01-01 | Paper |
| Subgraphs of colour-critical graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3767295 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3744181 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3726147 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3726148 | 1985-01-01 | Paper |
| Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3037476 | 1983-01-01 | Paper |
| Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659815 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3958489 | 1982-01-01 | Paper |
| Konstruktion schlichter transitiver Graphen mit maximaler Anzahl einfacher Eigenwerte | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3934433 | 1981-01-01 | Paper |
