| Publication | Date of Publication | Type |
|---|
| Describing edges in normal plane maps having no adjacent 3-faces | 2024-11-26 | Paper |
| Light 3-faces in 3-polytopes without adjacent triangles | 2024-11-09 | Paper |
| Light 3-paths in 3-polytopes without adjacent triangles | 2024-03-27 | Paper |
| Tight description of faces of triangulations on the torus | 2023-06-12 | Paper |
| Combinatorial structure of faces in triangulations on surfaces | 2022-08-03 | Paper |
| Another tight description of faces in plane triangulations with minimum degree 4 | 2022-06-14 | Paper |
| 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices | 2022-05-27 | Paper |
| Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7 | 2022-03-22 | Paper |
| Tight description of faces in torus triangulations with minimum degree 5 | 2021-12-08 | Paper |
| Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 | 2021-11-23 | Paper |
| All tight descriptions of major 3-paths in 3-polytopes without 3-vertices | 2021-06-17 | Paper |
| A tight description of 3-polytopes by their major 3-paths | 2021-06-07 | Paper |
| Heights of minor faces in 3-polytopes | 2021-04-08 | Paper |
| All tight descriptions of 3-paths in plane graphs with girth at least 7 | 2021-03-25 | Paper |
| Soft 3-stars in sparse plane graphs | 2020-11-24 | Paper |
| An extension of Franklin's theorem | 2020-09-24 | Paper |
| Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices | 2020-08-26 | Paper |
| Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9 | 2020-08-26 | Paper |
| All tight descriptions of 3-paths in plane graphs with girth 8 | 2020-05-21 | Paper |
| All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 | 2019-11-07 | Paper |
| Low faces of restricted degree in 3-polytopes | 2019-11-01 | Paper |
| Describing faces in 3-polytopes with no vertices of degree from 5 to 7 | 2019-09-11 | Paper |
| Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 | 2019-08-20 | Paper |
| Light minor 5-stars in 3-polytopes with minimum degree 5 | 2019-07-18 | Paper |
| An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations | 2019-06-27 | Paper |
| Light 3-stars in sparse plane graphs | 2019-05-08 | Paper |
| All tight descriptions of 3-paths in plane graphs with girth at least 9 | 2018-10-31 | Paper |
| Low minor faces in 3-polytopes | 2018-10-23 | Paper |
| All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) | 2018-10-23 | Paper |
| Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 | 2018-06-29 | Paper |
| Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 | 2018-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636916 | 2018-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635440 | 2018-04-20 | Paper |
| More about the height of faces in 3-polytopes | 2018-03-23 | Paper |
| Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 | 2018-01-19 | Paper |
| Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices | 2017-10-27 | Paper |
| Refined weight of edges in normal plane maps | 2017-09-05 | Paper |
| Tight Descriptions of 3‐Paths in Normal Plane Maps | 2017-06-30 | Paper |
| The height of faces of 3-polytopes | 2017-06-30 | Paper |
| All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 | 2017-06-29 | Paper |
| A Steinberg-like approach to describing faces in 3-polytopes | 2017-06-29 | Paper |
| On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 | 2017-06-23 | Paper |
| Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices | 2017-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963794 | 2017-02-21 | Paper |
| Describing 4-paths in 3-polytopes with minimum degree 5 | 2017-02-15 | Paper |
| All tight descriptions of 3-stars in 3-polytopes with girth 5 | 2017-01-23 | Paper |
| Low 5-stars in normal plane maps with minimum degree 5 | 2016-12-14 | Paper |
| Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 | 2016-12-06 | Paper |
| An extension of Kotzig's theorem | 2016-11-11 | Paper |
| Light and low 5-stars in normal plane maps with minimum degree 5 | 2016-09-29 | Paper |
| Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 | 2016-07-28 | Paper |
| On the weight of minor faces in triangle-free 3-polytopes | 2016-07-13 | Paper |
| An analogue of Franklin's theorem | 2016-06-16 | Paper |
| The weight of faces in normal plane maps | 2016-06-16 | Paper |
| Weight of edges in normal plane maps | 2016-04-07 | Paper |
| Heights of minor faces in triangle-free 3-polytopes | 2016-02-19 | Paper |
| The vertex-face weight of edges in 3-polytopes | 2016-01-06 | Paper |
| Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices | 2015-12-08 | Paper |
| The weight of edge in 3-polytopes | 2015-11-18 | Paper |
| Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 | 2015-11-16 | Paper |
| Weight of 3-paths in sparse plane graphs | 2015-11-02 | Paper |
| Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 | 2015-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3192480 | 2015-10-12 | Paper |
| Low edges in 3-polytopes | 2015-08-05 | Paper |
| Describing tight descriptions of 3-paths in triangle-free normal plane maps | 2015-06-29 | Paper |
| Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 | 2014-11-04 | Paper |
| Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 | 2014-08-14 | Paper |
| Precise upper bound for the strong edge chromatic number of sparse planar graphs | 2014-07-30 | Paper |
| 5-stars of low weight in normal plane maps with minimum degree 5 | 2014-07-28 | Paper |
| List 2-arboricity of planar graphs with no triangles at distance less than two | 2014-06-13 | Paper |
| Partitioning sparse plane graphs into two induced subgraphs of small degree | 2014-06-13 | Paper |
| Circular \((5,2)\)-coloring of sparse graphs | 2014-06-13 | Paper |
| Planar graphs without triangular 4-cycles are 3-choosable | 2014-06-13 | Paper |
| Describing faces in plane triangulations | 2014-01-27 | Paper |
| Describing 3-paths in normal plane maps | 2014-01-24 | Paper |
| Describing 3-faces in normal plane maps with minimum degree 4 | 2014-01-24 | Paper |
| Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 | 2014-01-16 | Paper |
| Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps | 2013-12-05 | Paper |
| Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 | 2013-12-05 | Paper |
| Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles | 2013-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906350 | 2013-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906273 | 2013-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906278 | 2013-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4906312 | 2013-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4900286 | 2013-01-14 | Paper |
| Acyclic 4-choosability of planar graphs without adjacent short cycles | 2012-10-26 | Paper |
| 2-distance 4-colorability of planar subcubic graphs with girth at least 22 | 2012-09-05 | Paper |
| \((k,j)\)-coloring of sparse graphs | 2012-04-30 | Paper |
| \((k,1)\)-coloring of sparse graphs | 2012-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115254 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115232 | 2012-02-20 | Paper |
| Oriented 5-coloring of sparse plane graphs | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115673 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115641 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115724 | 2012-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115557 | 2012-02-10 | Paper |
| List 2-facial 5-colorability of plane graphs with girth at least 12 | 2012-01-11 | Paper |
| Acyclic 5-choosability of planar graphs without 4-cycles | 2011-10-25 | Paper |
| Acyclic 5-choosability of planar graphs without adjacent short cycles | 2011-10-12 | Paper |
| List strong linear 2-arboricity of sparse graphs | 2011-06-07 | Paper |
| Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 | 2011-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5391631 | 2011-04-06 | Paper |
| List injective colorings of planar graphs | 2011-01-07 | Paper |
| Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k | 2010-11-10 | Paper |
| Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles | 2010-10-19 | Paper |
| Acyclic 3-choosability of sparse graphs with girth at least 7 | 2010-10-11 | Paper |
| Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable | 2009-12-18 | Paper |
| 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) | 2009-12-15 | Paper |
| Decompositions of quadrangle-free planar graphs | 2009-08-03 | Paper |
| List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six | 2009-06-17 | Paper |
| Planar graphs decomposable into a forest and a matching | 2009-01-28 | Paper |
| Minimax degrees of quasiplanar graphs with no short cycles other than triangles | 2008-09-29 | Paper |
| Decomposing a planar graph into a forest and a subgraph of restricted maximum degree | 2008-04-14 | Paper |
| Minimax degrees of quasiplane graphs without 4-faces | 2008-04-14 | Paper |
| Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6 | 2007-07-02 | Paper |
| List \((p,q)\)-coloring of sparse plane graphs | 2007-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409422 | 2006-11-17 | Paper |
| An oriented 7-colouring of planar graphs with girth at least 7 | 2006-08-24 | Paper |
| An oriented colouring of planar graphs with girth at least 4 | 2006-08-24 | Paper |
| 2-distance coloring of sparse planar graphs | 2005-12-19 | Paper |
| Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable | 2005-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4811984 | 2004-09-07 | Paper |
