| Publication | Date of Publication | Type |
|---|
| 2-distance \((\Delta + 1)\)-coloring of sparse graphs using the potential method | 2024-11-09 | Paper |
| The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree | 2023-07-19 | Paper |
| 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 | 2022-08-19 | Paper |
| $2$-distance list $(\Delta+2)$-coloring of planar graphs with girth at least 10 | 2021-09-29 | Paper |
| $2$-distance $(\Delta+2)$-coloring of sparse graphs | 2021-09-24 | Paper |
| 2-distance 4-coloring of planar subcubic graphs with girth at least 21 | 2021-06-07 | Paper |
| $2$-distance $(\Delta+1)$-coloring of sparse graphs using the potential method | 2021-03-22 | Paper |
| \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) | 2021-02-08 | Paper |
| Acyclic coloring of graphs and entropy compression method | 2020-02-20 | Paper |
| A lower bound on the order of the largest induced linear forest in triangle-free planar graphs | 2019-02-20 | Paper |
| Large induced forests in planar graphs with girth 4 | 2019-02-08 | Paper |
| Partitioning sparse graphs into an independent set and a forest of bounded degree | 2018-05-25 | Paper |
| Partitioning a triangle-free planar graph into a forest and a forest of bounded degree | 2017-09-11 | Paper |
| Partitioning a triangle-free planar graph into a forest and a forest of bounded degree | 2016-10-14 | Paper |
| A lower bound on the order of the largest induced forest in planar graphs with high girth | 2016-09-30 | Paper |
| 3-paths in graphs with bounded average degree | 2016-04-25 | Paper |
| Independent Domination in Cubic Graphs | 2016-02-01 | Paper |
| Optimal unavoidable sets of types of 3-paths for planar graphs of given girth | 2015-12-08 | Paper |
| Contact Representations of Planar Graphs: Extending a Partial Representation is Hard | 2015-09-09 | Paper |
| Near-colorings: non-colorable graphs and NP-completeness | 2015-03-11 | Paper |
| Design of fault-tolerant on-board networks with variable switch sizes | 2014-12-02 | Paper |
| Strong chromatic index of planar graphs with large girth | 2014-11-18 | Paper |
| Entropy compression method applied to graph colorings | 2014-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419976 | 2014-06-11 | Paper |
| On strong edge-colouring of subcubic graphs | 2014-04-10 | Paper |
| Vertex Partitions of Graphs into Cographs and Stars | 2014-01-28 | Paper |
| Limits of Near-Coloring of Sparse Graphs | 2014-01-28 | Paper |
| Generalized Power Domination in Regular Graphs | 2014-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857354 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857387 | 2013-11-01 | Paper |
| Acyclic choosability of planar graphs: a Steinberg like approach | 2013-10-10 | Paper |
| Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\) | 2013-08-09 | Paper |
| \(L(p,q)\)-labeling of sparse graphs | 2013-06-13 | Paper |
| A Complexity Dichotomy for the Coloring of Sparse Graphs | 2013-05-21 | Paper |
| Locally identifying coloring of graphs | 2012-10-24 | Paper |
| Generalized power domination of graphs | 2012-08-14 | Paper |
| On backbone coloring of graphs | 2012-07-10 | Paper |
| \((k,j)\)-coloring of sparse graphs | 2012-04-30 | Paper |
| \((k,1)\)-coloring of sparse graphs | 2012-04-13 | Paper |
| Decomposition of sparse graphs into two forests, one having bounded maximum degree | 2012-03-27 | Paper |
| Decomposing a graph into forests | 2012-03-19 | Paper |
| Covering a Graph by Forests and a Matching | 2012-03-15 | Paper |
| Some structural properties of planar graphs and their applications to 3-choosability | 2012-01-11 | Paper |
| On two variations of identifying codes | 2011-08-09 | Paper |
| Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k | 2010-11-10 | Paper |
| A note on the acyclic 3-choosability of some planar graphs | 2010-10-11 | Paper |
| Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable | 2010-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576668 | 2010-07-30 | Paper |
| Decomposition of sparse graphs, with application to game coloring number | 2010-05-05 | Paper |
| A relaxation of Havel's 3-color problem | 2010-04-19 | Paper |
| A note on the not 3-choosability of some families of planar graphs | 2010-01-29 | Paper |
| A note on 2-facial coloring of plane graphs | 2010-01-18 | Paper |
| Adapted list coloring of planar graphs | 2009-12-18 | Paper |
| Star coloring of sparse graphs | 2009-12-18 | Paper |
| Planar graphs without adjacent cycles of length at most seven are 3-colorable | 2009-12-15 | Paper |
| On the 3-colorability of planar graphs without 4-, 7- and 9-cycles | 2009-12-10 | Paper |
| Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable | 2009-06-23 | Paper |
| An upper bound on adaptable choosability of graphs | 2009-03-04 | Paper |
| Linear choosability of graphs | 2008-07-11 | Paper |
| Strong oriented chromatic number of planar graphs without cycles of specific lengths | 2008-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387726 | 2008-05-27 | Paper |
| \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree | 2007-06-26 | Paper |
| A small non-\(\mathbb Z_4\)-colorable planar graph | 2007-05-11 | Paper |
| Acyclic 5-choosability of planar graphs without small cycles | 2007-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424787 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424893 | 2007-03-05 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Bordeaux 3-color conjecture and 3-choosability | 2006-05-16 | Paper |
| On the acyclic choosability of graphs | 2006-05-16 | Paper |
| (d,1)-total labeling of graphs with a given maximum average degree | 2006-03-24 | Paper |
