| Publication | Date of Publication | Type |
|---|
| Kempe equivalent list colorings | 2024-04-09 | Paper |
| 5‐Coloring reconfiguration of planar graphs with no short odd cycles | 2024-02-23 | Paper |
| Odd-sum colorings of planar graphs | 2024-01-24 | Paper |
| Kempe equivalent list edge-colorings of planar graphs | 2023-11-27 | Paper |
| Equitable Coloring in 1-Planar Graphs | 2023-11-24 | Paper |
| Optimally reconfiguring list and correspondence colourings | 2023-10-25 | Paper |
| Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors | 2023-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134964 | 2023-08-23 | Paper |
| Coloring, list coloring, and painting squares of graphs (and other related problems) | 2023-08-16 | Paper |
| Kempe Classes and Almost Bipartite Graphs | 2023-03-16 | Paper |
| A note on odd colorings of 1-planar graphs | 2023-03-13 | Paper |
| The Iterated Local Directed Transitivity Model for Social Networks | 2022-10-14 | Paper |
| On asymptotic packing of geometric graphs | 2022-10-13 | Paper |
| Strong edge-coloring of cubic bipartite graphs: a counterexample | 2022-09-15 | Paper |
| Planar Turán numbers of cycles: a counterexample | 2022-09-06 | Paper |
| List-recoloring of sparse graphs | 2022-06-20 | Paper |
| In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent | 2022-05-31 | Paper |
| A Note on Odd Colorings of 1-Planar Graphs | 2022-02-05 | Paper |
| Odd Colorings of Sparse Graphs | 2022-01-05 | Paper |
| Vertex Partitions into an Independent Set and a Forest with Each Component Small | 2021-08-20 | Paper |
| Degeneracy and colorings of squares of planar graphs without 4-cycles | 2021-03-20 | Paper |
| Sparse Graphs Are Near-Bipartite | 2020-10-28 | Paper |
| A characterization of (4,2)‐choosable graphs | 2020-07-17 | Paper |
| Circular Flows in Planar Graphs | 2020-02-20 | Paper |
| A Note on Bootstrap Percolation Thresholds in Plane Tilings using Regular Polygons | 2019-09-19 | Paper |
| The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 | 2019-08-29 | Paper |
| Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large | 2019-04-24 | Paper |
| Edge lower bounds for list critical graphs, via discharging | 2019-02-01 | Paper |
| Planar graphs of girth at least five are square \((\delta + 2)\)-choosable | 2018-12-20 | Paper |
| Planar graphs are \(9/2\)-colorable | 2018-10-11 | Paper |
| Proper distinguishing colorings with few colors for graphs with girth at least 5 | 2018-08-15 | Paper |
| The fractional chromatic number of the plane | 2018-07-23 | Paper |
| Modified linear programming and class 0 bounds for graph pebbling | 2017-10-17 | 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 the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles | 2017-08-10 | Paper |
| List-Coloring Claw-Free Graphs with $\Delta-1$ Colors | 2017-05-24 | Paper |
| An introduction to the discharging method via graph coloring | 2017-02-06 | 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 |
| On the boundedness of positive solutions of the reciprocal MAX-type difference equation \(x_n=\max\left\{\frac{A_{n-1}^1}{x_{n-1}},\frac{A_{n-1}^2}{x_{n-2}},\cdots,\frac{A_{n-1}^t}{x_{n-t}}\right\}\) with periodic parameters | 2016-01-19 | Paper |
| Graphs with $\chi=\Delta$ Have Big Cliques | 2015-10-02 | Paper |
| Regular Graphs of Odd Degree Are Antimagic | 2015-09-29 | 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 |
| The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs | 2014-11-18 | Paper |
| Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) | 2014-09-12 | Paper |
| Choosability of the square of a planar graph with maximum degree four | 2014-08-15 | Paper |
| Game matching number of graphs | 2014-04-22 | Paper |
| Hamiltonicity in connected regular graphs | 2014-04-14 | Paper |
| Coloring Claw-Free Graphs with $\Delta-1$ Colors | 2013-06-27 | Paper |
| Chain-making games in grid-like posets | 2013-06-25 | Paper |
| New results in \(t\)-tone coloring of graphs | 2013-06-07 | Paper |
| Revolutionaries and spies on trees and unicyclic graphs | 2013-02-28 | Paper |
| Revolutionaries and spies: spy-good and spy-bad graphs | 2013-01-07 | Paper |
| List Colorings of K5-Minor-Free Graphs With Special List Assignments | 2012-09-12 | Paper |
| Overlap number of graphs | 2012-06-04 | Paper |
| Linear choosability of sparse graphs | 2011-08-09 | Paper |
| Injective colorings of graphs with low average degree | 2011-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3001606 | 2011-05-31 | Paper |
| Injective colorings of sparse graphs | 2010-10-19 | Paper |
| Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable | 2010-06-01 | Paper |
| A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid | 2010-03-26 | Paper |
| Star coloring of sparse graphs | 2009-12-18 | Paper |
| Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable | 2009-12-09 | Paper |
| Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles | 2009-08-03 | Paper |
| Crossings, colorings, and cliques | 2009-07-08 | Paper |
| Regular bipartite graphs are antimagic | 2009-03-04 | Paper |
| Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) | 2009-01-28 | Paper |
| List-coloring the square of a subcubic graph | 2008-11-19 | Paper |
| Nomadic decompositions of bidirected complete graphs | 2008-07-11 | Paper |
| Pebbling and optimal pebbling in graphs | 2008-03-20 | Paper |
| Short proofs for cut-and-paste sorting of permutations | 2007-11-27 | Paper |
| Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem | 2007-08-21 | Paper |
| Strong edge-coloring of graphs with maximum degree 4 using 22 colors | 2006-10-30 | Paper |
