| Publication | Date of Publication | Type |
|---|
| Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable | 2022-03-21 | Paper |
| \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) | 2022-02-14 | Paper |
| Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable | 2021-12-17 | Paper |
| Improper colorability of planar graphs with cycles of length neither 4 nor 6 | 2021-12-17 | Paper |
| 没有4至6-圈的平面图是(1,0,0)-可染的 | 2021-12-17 | Paper |
| A sufficient condition for a planar graph to be 3-colorable | 2021-12-17 | Paper |
| Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable | 2021-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4641211 | 2018-05-25 | Paper |
| Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable | 2018-01-19 | Paper |
| Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable | 2017-08-31 | Paper |
| Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable | 2017-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2983564 | 2017-05-17 | Paper |
| Improved Upper Bound of Linear 2-arboricity of Planar Graphs | 2016-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2824705 | 2016-10-06 | 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 |
| Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable | 2015-12-08 | Paper |
| The 3-colorability of planar graphs without cycles of length 4, 6 and 9 | 2015-10-08 | Paper |
| \((1,0,0)\)-colorability of planar graphs without prescribed short cycles | 2015-09-28 | Paper |
| Distance constraints on short cycles for 3-colorability of planar graphs | 2015-09-24 | Paper |
| (3, 1)-choosability of toroidal graphs with some forbidden short cycles | 2015-04-28 | Paper |
| Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable | 2015-01-21 | Paper |
| Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph | 2014-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4980484 | 2014-06-30 | Paper |
| Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles | 2014-06-24 | Paper |
| \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 | 2014-05-06 | Paper |
| Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable | 2014-05-06 | Paper |
| Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable | 2014-04-11 | Paper |
| Improper Choosability of Planar Graphs without 4-Cycles | 2014-04-10 | Paper |
| Improper colorability of planar graphs without prescribed short cycles | 2014-02-27 | Paper |
| Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable | 2014-01-23 | Paper |
| Plane Graphs with Maximum Degree Are Entirely ‐Colorable | 2013-07-31 | Paper |
| \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle | 2013-04-04 | Paper |
| Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable | 2013-03-04 | Paper |
| A sufficient condition for a plane graph with maximum degree 6 to be class 1 | 2012-11-22 | Paper |
| Acyclic edge coloring of sparse graphs | 2012-11-20 | Paper |
| Linear coloring of sparse graphs | 2012-05-04 | Paper |
| On acyclic edge coloring of planar graphs without intersecting triangles | 2012-04-13 | Paper |
| \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles | 2012-03-27 | Paper |
| On 3-choosability of triangle-free plane graphs | 2012-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3099255 | 2011-12-01 | Paper |
| A structural theorem for planar graphs with some applications | 2011-08-10 | Paper |
| Decomposing a planar graph with girth at least 8 into a forest and a matching | 2011-05-10 | Paper |
| Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable | 2011-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3051722 | 2010-11-05 | Paper |
| Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable | 2010-10-11 | Paper |
| On 3-colorability of planar graphs without adjacent short cycles | 2010-06-21 | Paper |
| Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable | 2010-04-28 | Paper |
| A relaxation of Havel's 3-color problem | 2010-04-19 | Paper |
| A sufficient condition for a planar graph to be 3-choosable | 2010-03-24 | Paper |
| A note on 3-choosability of planar graphs | 2010-03-24 | Paper |
| Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable | 2009-12-15 | Paper |
| On the 3-colorability of planar graphs without 4-, 7- and 9-cycles | 2009-12-10 | Paper |
| On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles | 2009-12-09 | Paper |
| Total colorings of planar graphs with maximum degree at least 8 | 2009-12-07 | Paper |
| On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles | 2009-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3611310 | 2009-03-06 | Paper |
| On the diameter of generalized Kneser graphs | 2008-09-04 | Paper |
| Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable | 2008-07-11 | Paper |
| On total chromatic number of planar graphs without 4-cycles | 2007-07-30 | Paper |
| Optimization problems of the third edge-connectivity of graphs | 2007-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3411446 | 2006-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409615 | 2006-11-20 | Paper |
| Upper bound on the third edge-connectivity of graphs | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654484 | 2005-03-04 | Paper |
| Super restricted edge-connectivity of vertex-transitive graphs | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764679 | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2704926 | 2001-08-30 | Paper |
