| Publication | Date of Publication | Type |
|---|
| The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree | 2023-11-27 | Paper |
| Yet another proof of Brooks' theorem | 2023-11-27 | Paper |
| Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors | 2023-10-05 | Paper |
| Playing cards with Vizing's demon | 2021-04-09 | Paper |
| Structural fixed-point theorems | 2021-04-09 | Paper |
| Improved lower bounds on the number of edges in list critical and online list critical graphs | 2020-01-15 | Paper |
| The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 | 2019-08-29 | Paper |
| Edge lower bounds for list critical graphs, via discharging | 2019-02-01 | Paper |
| Planar graphs are \(9/2\)-colorable | 2018-10-11 | Paper |
| The fractional chromatic number of the plane | 2018-07-23 | Paper |
| A better lower bound on average degree of online \(k\)-list-critical graphs | 2018-05-25 | Paper |
| Extracting List Colorings from Large Independent Sets | 2017-12-01 | Paper |
| Subcubic Edge‐Chromatic Critical Graphs Have Many Edges | 2017-09-26 | Paper |
| Short Fans and the 5/6 Bound for Line Graphs | 2017-09-18 | Paper |
| Beyond degree choosability | 2017-09-08 | Paper |
| List-Coloring Claw-Free Graphs with $\Delta-1$ Colors | 2017-05-24 | Paper |
| A better lower bound on average degree of 4-list-critical graphs | 2016-09-13 | Paper |
| Planar graphs have independence ratio at least 3/13 | 2016-09-13 | Paper |
| Painting squares in \(\Delta^2-1\) shades | 2016-07-06 | Paper |
| Brooks' Theorem and Beyond | 2016-02-01 | Paper |
| Graphs with $\chi=\Delta$ Have Big Cliques | 2015-10-02 | Paper |
| Edge-coloring via fixable subgraphs | 2015-07-20 | Paper |
| A note on coloring vertex-transitive graphs | 2015-04-22 | Paper |
| Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker | 2014-11-19 | Paper |
| Coloring Graphs with Dense Neighborhoods | 2014-08-07 | Paper |
| A different short proof of Brooks' theorem | 2014-07-28 | Paper |
| A game generalizing Hall's theorem | 2014-01-27 | Paper |
| Dangerous reference graphs and semantic paradoxes | 2013-11-15 | Paper |
| Coloring Claw-Free Graphs with $\Delta-1$ Colors | 2013-06-27 | Paper |
| Partitioning and coloring graphs with degree constraints | 2013-04-11 | Paper |
| Destroying Noncomplete Regular Components in Graph Partitions | 2013-03-07 | Paper |
| Graphs with chromatic number close to maximum degree | 2012-04-13 | Paper |
| \(\Delta \)-critical graphs with small high vertex cliques | 2012-03-19 | Paper |
| A strengthening of Brooks' Theorem for line graphs | 2011-07-29 | Paper |
| A note on vertex partitions | 2011-07-08 | Paper |
| An improvement on Brooks' Theorem | 2011-02-04 | Paper |
| On hitting all maximum cliques with an independent set | 2011-01-20 | Paper |
| A Note On Reed's Conjecture | 2009-05-27 | Paper |
| The Borodin-Kostochka conjecture for graphs containing a doubly critical edge | 2009-04-07 | Paper |
| A simple solution to the hardest logic puzzle ever | 2008-08-21 | Paper |
| A Novel Proof of the Heine-Borel Theorem | 2008-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3510977 | 2008-07-03 | Paper |
| At Least Half Of All Graphs Satisfy \chi \leq {1/4}\omega + {3/4}\Delta + 1 | 2007-08-22 | Paper |
| Coloring and The Lonely Graph | 2007-07-07 | Paper |
| On Graph Associations | 2007-05-22 | Paper |
| Applying Gröbner basis techniques to group theory. | 2007-04-26 | Paper |
| Some bounds on convex combinations of $\omega$ and $\chi$ for decompositions into many parts | 2005-12-13 | Paper |
