| Publication | Date of Publication | Type |
|---|
| List dynamic 4-coloring of planar graphs | 2025-01-10 | Paper |
| Tight upper bound on the clique size in the square of 2-degenerate graphs | 2023-11-06 | Paper |
| Signed colouring and list colouring of k‐chromatic graphs | 2023-10-05 | Paper |
| The square of every subcubic planar graph of girth at least 6 is 7-choosable | 2023-05-09 | Paper |
| Planar graphs without intersecting 5-cycles are signed-4-choosable | 2022-09-02 | Paper |
| The Alon-Tarsi number of \(K_5\)-minor-free graphs | 2022-02-14 | Paper |
| On list 3-dynamic coloring of near-triangulations | 2020-11-02 | Paper |
| The minimum spectral radius of \(K_{r + 1}\)-saturated graphs | 2020-09-10 | Paper |
| On-line DP-coloring of graphs | 2020-08-31 | Paper |
| Planar graphs without 7-cycles and butterflies are DP-4-colorable | 2020-06-08 | Paper |
| $K_{r+1}$-saturated graphs with small spectral radius | 2020-06-08 | Paper |
| Coloring squares of graphs with mad constraints | 2019-11-27 | Paper |
| Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable | 2019-06-28 | Paper |
| A note on a Brooks' type theorem for DP‐coloring | 2019-06-14 | Paper |
| The Alon-Tarsi number of subgraphs of a planar graph | 2019-06-04 | Paper |
| 3-dynamic coloring of planar triangulations | 2018-09-21 | Paper |
| Cycles with two blocks in k‐chromatic digraphs | 2018-08-16 | Paper |
| A sufficient condition for DP-4-colorability | 2018-05-24 | Paper |
| List 3-dynamic coloring of graphs with small maximum average degree | 2018-04-05 | Paper |
| Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) | 2016-11-25 | Paper |
| Coloring of the square of Kneser graph \(K(2k+r,k)\) | 2016-07-28 | Paper |
| Coloring the square of graphs whose maximum average degree is less than 4 | 2016-01-21 | Paper |
| Counterexamples to the List Square Coloring Conjecture | 2015-03-24 | Paper |
| Bipartite graphs whose squares are not chromatic-choosable | 2015-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2936690 | 2015-01-06 | Paper |
| Chromatic-choosability of the power of graphs | 2014-11-28 | Paper |
| Dynamic coloring and list dynamic coloring of planar graphs | 2014-04-22 | Paper |
| Improved bounds on the chromatic numbers of the square of Kneser graphs | 2014-01-16 | Paper |
| Decomposition of sparse graphs into forests and a graph with bounded degree | 2013-11-15 | Paper |
| Injectively delta choosable graphs | 2013-08-26 | Paper |
| Graph equation for line graphs and \(m\)-step graphs | 2013-01-03 | Paper |
| On-line list colouring of complete multipartite graphs | 2012-06-12 | Paper |
| The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes | 2012-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3114944 | 2012-02-20 | Paper |
| List Dynamic Coloring of Sparse Graphs | 2011-08-12 | Paper |
| Injective colorings of graphs with low average degree | 2011-06-30 | Paper |
| Graphs having many holes but with small competition numbers | 2011-06-01 | Paper |
| Identifying codes in \(q\)-ary hypercubes | 2011-04-18 | Paper |
| Injective colorings of sparse graphs | 2010-10-19 | Paper |
| Triangle-free planar graphs with minimum degree 3 have radius at least 3 | 2009-06-23 | Paper |
| List-coloring the square of a subcubic graph | 2008-11-19 | Paper |
| Coloring the complements of intersection graphs of geometric figures | 2008-09-04 | Paper |
| On CCE graphs of doubly partial orders | 2007-05-30 | Paper |
| Transversal numbers of translates of a convex body | 2006-10-19 | Paper |
| On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\) | 2004-12-13 | Paper |
| On the chromatic number of intersection graphs of convex sets in the plane | 2004-10-13 | Paper |
| Homomorphisms from sparse graphs with large girth. | 2004-03-15 | Paper |
| Isometric cycles, cutsets, and crowning of bridged graphs | 2003-07-31 | Paper |
