| Publication | Date of Publication | Type |
|---|
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
Discrete Mathematics | 2023-11-27 | Paper |
Yet another proof of Brooks' theorem
Discrete Mathematics | 2023-11-27 | Paper |
Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
Journal of Graph Theory | 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
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
The Hilton-Zhao conjecture is true for graphs with maximum degree 4
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Edge lower bounds for list critical graphs, via discharging
Combinatorica | 2019-02-01 | Paper |
Planar graphs are \(9/2\)-colorable
Journal of Combinatorial Theory. Series B | 2018-10-11 | Paper |
The fractional chromatic number of the plane
Combinatorica | 2018-07-23 | Paper |
A better lower bound on average degree of online \(k\)-list-critical graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Extracting List colorings from large independent sets
Journal of Graph Theory | 2017-12-01 | Paper |
Subcubic edge-chromatic critical graphs have many edges
Journal of Graph Theory | 2017-09-26 | Paper |
Short fans and the 5/6 bound for line graphs
SIAM Journal on Discrete Mathematics | 2017-09-18 | Paper |
Beyond degree choosability
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
List-coloring claw-free graphs with \(\Delta-1\) colors
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
A better lower bound on average degree of 4-list-critical graphs
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Planar graphs have independence ratio at least 3/13
The Electronic Journal of Combinatorics | 2016-09-13 | Paper |
Painting squares in \(\Delta^2-1\) shades
The Electronic Journal of Combinatorics | 2016-07-06 | Paper |
Brooks' Theorem and Beyond
Journal of Graph Theory | 2016-02-01 | Paper |
Graphs with \(\chi=\Delta\) have big cliques
SIAM Journal on Discrete Mathematics | 2015-10-02 | Paper |
Edge-coloring via fixable subgraphs
| 2015-07-20 | Paper |
A note on coloring vertex-transitive graphs
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
European Journal of Combinatorics | 2014-11-19 | Paper |
Coloring Graphs with Dense Neighborhoods
Journal of Graph Theory | 2014-08-07 | Paper |
A different short proof of Brooks' theorem
Discussiones Mathematicae Graph Theory | 2014-07-28 | Paper |
A game generalizing Hall's theorem
Discrete Mathematics | 2014-01-27 | Paper |
Dangerous reference graphs and semantic paradoxes
Journal of Philosophical Logic | 2013-11-15 | Paper |
Coloring Claw-Free Graphs with $\Delta-1$ Colors
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Partitioning and coloring graphs with degree constraints
Discrete Mathematics | 2013-04-11 | Paper |
Destroying noncomplete regular components in graph partitions
Journal of Graph Theory | 2013-03-07 | Paper |
Graphs with chromatic number close to maximum degree
Discrete Mathematics | 2012-04-13 | Paper |
\(\Delta \)-critical graphs with small high vertex cliques
Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
A strengthening of Brooks' Theorem for line graphs
The Electronic Journal of Combinatorics | 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
Journal of Graph Theory | 2011-01-20 | Paper |
A Note On Reed's Conjecture
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
The Borodin-Kostochka conjecture for graphs containing a doubly critical edge
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A simple solution to the hardest logic puzzle ever
Analysis | 2008-08-21 | Paper |
A Novel Proof of the Heine-Borel Theorem
| 2008-08-06 | Paper |
A knowledge-based system for graph theory demonstrated by partial proofs for graph-colouring problems
| 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
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Applying Gröbner basis techniques to group theory.
Journal of Pure and Applied Algebra | 2007-04-26 | Paper |
Some bounds on convex combinations of $\omega$ and $\chi$ for decompositions into many parts
| 2005-12-13 | Paper |
