| Publication | Date of Publication | Type |
|---|
Brooks' Theorem
Springer Monographs in Mathematics | 2024-03-19 | Paper |
Generalized DP-colorings of graphs
Discrete Mathematics | 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
Journal of Graph Theory | 2023-09-29 | Paper |
Point partition numbers: decomposable and indecomposable critical graphs
Discrete Mathematics | 2022-05-27 | Paper |
On DP‐coloring of digraphs
Journal of Graph Theory | 2022-03-31 | Paper |
Point partition numbers: perfect graphs
Graphs and Combinatorics | 2022-03-15 | Paper |
Digraphs and variable degeneracy
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Coloring hypergraphs of low connectivity
Journal of Combinatorics | 2022-02-03 | Paper |
Vertex partition of hypergraphs and maximum degenerate subhypergraphs
Electronic Journal of Graph Theory and Applications | 2021-09-06 | Paper |
The minimum number of edges in 4-critical digraphs of given order
Graphs and Combinatorics | 2020-04-30 | Paper |
Hajós and Ore constructions for digraphs
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Hajós and Ore constructions for digraphs
The Electronic Journal of Combinatorics | 2020-03-30 | Paper |
Graph edge coloring: a survey
Graphs and Combinatorics | 2019-03-21 | Paper |
Partitions of multigraphs under minimum degree constraints
Discrete Applied Mathematics | 2019-03-11 | Paper |
On DP-Coloring of Digraphs
(available as arXiv preprint) | 2018-12-23 | Paper |
A Brooks type theorem for the maximum local edge connectivity
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A Brooks type theorem for the maximum local edge connectivity
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
In memoriam: Horst Sachs (1927--2016)
Discrete Mathematics | 2017-09-05 | Paper |
A relaxed version of the Erdős-Lovász Tihany conjecture
Journal of Graph Theory | 2017-06-30 | Paper |
Degree choosable signed graphs
Discrete Mathematics | 2017-02-27 | Paper |
| Brook's theorem | 2016-09-30 | Paper |
| List-colourings | 2016-09-30 | Paper |
Decomposable and indecomposable critical hypergraphs
Journal of Combinatorics | 2016-05-25 | Paper |
Orientations of graphs with prescribed weighted out-degrees
Graphs and Combinatorics | 2015-01-20 | Paper |
The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \)
Graphs and Combinatorics | 2012-12-27 | Paper |
Graphs with chromatic number close to maximum degree
Discrete Mathematics | 2012-04-13 | Paper |
| Graph edge coloring. Vizing's theorem and Goldberg's conjecture | 2012-03-06 | Paper |
Ohba's conjecture for graphs with independence number five
Discrete Mathematics | 2011-05-16 | Paper |
Vizing's coloring algorithm and the fan number
Journal of Graph Theory | 2010-11-10 | Paper |
Graphs with bounded tree-width and large odd-girth are almost bipartite
Journal of Combinatorial Theory. Series B | 2010-11-05 | Paper |
A new lower bound on the number of perfect matchings in cubic graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Edge colouring by total labellings
Discrete Mathematics | 2010-03-29 | Paper |
On Vizing's bound for the chromatic index of a multigraph
Discrete Mathematics | 2009-12-15 | Paper |
On list critical graphs
Discrete Mathematics | 2009-12-15 | Paper |
The Erdős-Lovász tihany conjecture for quasi-line graphs
Discrete Mathematics | 2009-12-09 | Paper |
A list version of Dirac's theorem on the number of edges in colour-critical graphs
Journal of Graph Theory | 2009-12-08 | Paper |
Partitions and edge colourings of multigraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Partitions and edge colourings of multigraphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Ordered and linked chordal graphs
Discussiones Mathematicae Graph Theory | 2009-02-26 | Paper |
List colorings with measurable sets
Journal of Graph Theory | 2009-02-20 | Paper |
A map colour theorem for the union of graphs
Journal of Combinatorial Theory. Series B | 2006-01-10 | Paper |
Nordhaus–Gaddum‐type Theorems for decompositions into many parts
Journal of Graph Theory | 2005-12-08 | Paper |
Deeply asymmetric planar graphs
Journal of Combinatorial Theory. Series B | 2005-09-28 | Paper |
On a special case of Hadwiger's conjecture
Discussiones Mathematicae Graph Theory | 2004-10-27 | Paper |
Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
Journal of Graph Theory | 2004-03-29 | Paper |
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
On the number of edges in colour-critical graphs and hypergraphs
Combinatorica | 2001-06-13 | Paper |
Colour-critical graphs with few edges
Discrete Mathematics | 2000-11-02 | Paper |
| Dirac's map-color theorem for choosability | 2000-08-03 | Paper |
| scientific article; zbMATH DE number 1303523 (Why is no real title available?) | 2000-01-09 | Paper |
The colour theorems of Brooks and Gallai extended
Discrete Mathematics | 1997-09-24 | Paper |
| scientific article; zbMATH DE number 944226 (Why is no real title available?) | 1997-07-07 | Paper |
| scientific article; zbMATH DE number 970801 (Why is no real title available?) | 1997-03-11 | Paper |
An abstract generalization of a map reduction theorem of Birkhoff
Journal of Combinatorial Theory. Series B | 1996-02-22 | Paper |
On Colouring Partial Joins of a Complete Graph and a Cycle
Mathematische Nachrichten | 1994-08-21 | Paper |
The forest plus stars colouring problem
Discrete Mathematics | 1994-04-04 | Paper |
On Hadwiger's number---A problem of the Nordhaus-Gaddum type
Discrete Mathematics | 1993-01-16 | Paper |
A solution to a colouring problem of P. Erdős
Discrete Mathematics | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 90113 (Why is no real title available?) | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 4185642 (Why is no real title available?) | 1990-01-01 | Paper |
On constructive methods in the theory of colour-critical graphs
Discrete Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4095495 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4053543 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4123758 (Why is no real title available?) | 1988-01-01 | Paper |
\(K_ 5\) is the only double-critical 5-chromatic graph
Discrete Mathematics | 1987-01-01 | Paper |
Subgraphs of colour-critical graphs
Combinatorica | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4025370 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3979084 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3957142 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3957143 (Why is no real title available?) | 1985-01-01 | Paper |
Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3829959 (Why is no real title available?) | 1983-01-01 | Paper |
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
Combinatorica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3811613 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3779360 (Why is no real title available?) | 1982-01-01 | Paper |
Konstruktion schlichter transitiver Graphen mit maximaler Anzahl einfacher Eigenwerte
Mathematische Nachrichten | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3751004 (Why is no real title available?) | 1981-01-01 | Paper |
