| Publication | Date of Publication | Type |
|---|
| An (F1,F4)‐partition of graphs with low genus and girth at least 6 | 2023-10-04 | Paper |
| 2-distance choosability of planar graphs with a restriction for maximum degree | 2023-04-21 | Paper |
| An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 | 2022-11-23 | Paper |
| 子立方平面图的$(1,0)$-松弛强边列表染色 | 2022-09-29 | Paper |
| Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable | 2022-03-21 | Paper |
| Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles | 2022-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5153438 | 2021-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4996553 | 2021-07-01 | Paper |
| On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 | 2021-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4990127 | 2021-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4983942 | 2021-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5129363 | 2020-10-27 | Paper |
| Acyclic 4-choosability of planar graphs without 4-cycles | 2020-07-02 | Paper |
| Facial edge-face coloring of \(K_4\)-minor-free graphs | 2020-04-21 | Paper |
| List vertex-arboricity of planar graphs without intersecting 5-cycles | 2020-04-15 | Paper |
| Choosability with separation of planar graphs without prescribed cycles | 2020-01-15 | Paper |
| (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 | 2020-01-02 | Paper |
| Acyclic improper choosability of subcubic graphs | 2019-11-29 | Paper |
| On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree | 2019-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4623681 | 2019-02-22 | Paper |
| A note on the list vertex arboricity of toroidal graphs | 2018-10-23 | Paper |
| 2-distance vertex-distinguishing index of subcubic graphs | 2018-07-26 | Paper |
| On choosability with separation of planar graphs without adjacent short cycles | 2018-07-24 | Paper |
| Planar graphs with maximum degree 4 are strongly 19-edge-colorable | 2018-04-19 | Paper |
| Acyclic 4-choosability of planar graphs without intersecting short cycles | 2018-02-23 | Paper |
| A sufficient condition for planar graphs to be (3,1)-choosable | 2017-11-09 | Paper |
| A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable | 2017-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2983564 | 2017-05-17 | Paper |
| Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) | 2016-11-25 | Paper |
| A \((3,1)^\ast\)-choosable theorem on planar graphs | 2016-10-12 | Paper |
| Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable | 2016-08-16 | Paper |
| Planar graphs without 4-cycles adjacent to triangles are 4-choosable | 2016-08-16 | Paper |
| List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles | 2016-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501171 | 2015-08-13 | Paper |
| Acyclic 6-choosability of planar graphs without adjacent short cycles | 2014-12-02 | Paper |
| Plane graphs with maximum degree 6 are edge-face 8-colorable | 2014-09-19 | Paper |
| On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles | 2014-09-12 | Paper |
| Star list chromatic number of planar subcubic graphs | 2014-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403010 | 2014-03-25 | Paper |
| Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable | 2013-10-10 | Paper |
| Planar graphs without 4- and 5-cycles are acyclically 4-choosable | 2013-04-25 | Paper |
| 6-Star-Coloring of Subcubic Graphs | 2013-03-07 | Paper |
| Some results on the injective chromatic number of graphs | 2013-01-03 | Paper |
| A sufficient condition for planar graphs to be acyclically 5-choosable | 2012-06-04 | Paper |
| Vertex-arboricity of planar graphs without intersecting triangles | 2012-05-04 | Paper |
| Some structural properties of planar graphs and their applications to 3-choosability | 2012-01-11 | Paper |
| Acyclic 4-choosability of planar graphs | 2011-01-07 | Paper |
| Homomorphisms from sparse graphs to the Petersen graph | 2010-10-18 | Paper |
| Acyclic 3-choosability of sparse graphs with girth at least 7 | 2010-10-11 | Paper |
| On acyclic 4-choosability of planar graphs without short cycles | 2010-07-07 | Paper |
| On 3-colorable planar graphs without cycles of four lengths | 2010-03-24 | Paper |
| Three-coloring planar graphs without short cycles | 2010-01-29 | Paper |
| Planar graphs without 4-cycles are acyclically 6-choosable | 2009-12-18 | Paper |
| On 3-colorable planar graphs without short cycles | 2009-01-29 | Paper |
| Acyclic 5-choosability of planar graphs without 4-cycles | 2009-01-28 | Paper |
| Planar graphs without 4, 6, 8-cycles are 3-colorable | 2008-03-11 | Paper |
| On 3-colorable planar graphs without prescribed cycles | 2007-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5469804 | 2006-05-26 | Paper |
