| Publication | Date of Publication | Type |
|---|
| An (F1,F4)‐partition of graphs with low genus and girth at least 6 | 2023-10-04 | Paper |
| Injective edge-coloring of subcubic graphs | 2023-07-13 | Paper |
| An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 | 2022-11-23 | Paper |
| A note on adaptable choosability and choosability with separation of planar graphs | 2021-06-23 | Paper |
| Injective edge-coloring of graphs with given maximum degree | 2021-06-18 | Paper |
| On star edge colorings of bipartite and subcubic graphs | 2021-05-31 | Paper |
| Cut-edges and regular factors in regular graphs of odd degree | 2021-03-17 | Paper |
| Choosability with separation of planar graphs without prescribed cycles | 2020-01-15 | Paper |
| Acyclic improper choosability of subcubic graphs | 2019-11-29 | Paper |
| List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs | 2019-05-17 | Paper |
| Oriented incidence colourings of digraphs | 2018-12-05 | Paper |
| List star edge-coloring of subcubic graphs | 2018-08-10 | Paper |
| List star chromatic index of sparse graphs | 2018-05-24 | Paper |
| List star edge coloring of sparse graphs | 2018-02-22 | Paper |
| Strong edge-colorings of sparse graphs with large maximum degree | 2017-10-10 | Paper |
| Incidence coloring of graphs with high maximum average degree | 2017-06-19 | Paper |
| On weight choosabilities of graphs with bounded maximum average degree | 2017-03-15 | Paper |
| Incidence coloring of planar graphs without adjacent small cycles | 2017-01-10 | Paper |
| A \((3,1)^\ast\)-choosable theorem on planar graphs | 2016-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816083 | 2016-07-01 | Paper |
| Circuit Covers of Signed Graphs | 2016-02-01 | Paper |
| The chromatic number of a signed graph | 2016-01-25 | Paper |
| Planar graphs with girth at least 5 are \((3, 5)\)-colorable | 2015-01-23 | Paper |
| Strong chromatic index of planar graphs with large girth | 2014-11-18 | 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 |
| Obstructions to locally injective oriented improper colourings | 2014-07-29 | Paper |
| Star list chromatic number of planar subcubic graphs | 2014-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419976 | 2014-06-11 | Paper |
| On strong edge-colouring of subcubic graphs | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403010 | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403041 | 2014-03-25 | 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/Q2857412 | 2013-11-01 | Paper |
| Game chromatic number of toroidal grids | 2013-10-10 | Paper |
| Chromatic number of sparse colored mixed planar graphs | 2013-10-10 | Paper |
| Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable | 2013-10-10 | Paper |
| \(L(p,q)\)-labeling of sparse graphs | 2013-06-13 | 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 |
| Generalized power domination of graphs | 2012-08-14 | Paper |
| On backbone coloring of graphs | 2012-07-10 | Paper |
| On the size of identifying codes in triangle-free graphs | 2012-06-18 | Paper |
| A sufficient condition for planar graphs to be acyclically 5-choosable | 2012-06-04 | Paper |
| The minimum identifying code graphs | 2012-05-30 | Paper |
| Vertex-arboricity of planar graphs without intersecting triangles | 2012-05-04 | 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 |
| Short cycle covers of graphs and nowhere-zero flows | 2011-12-20 | Paper |
| Circular flow on signed graphs | 2011-12-08 | Paper |
| Upper bounds on the linear chromatic number of a graph | 2011-02-18 | Paper |
| Acyclic 4-choosability 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 |
| Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable | 2010-10-18 | Paper |
| Homomorphisms from sparse graphs to the Petersen graph | 2010-10-18 | Paper |
| A note on the acyclic 3-choosability of some planar graphs | 2010-10-11 | Paper |
| Acyclic 3-choosability of sparse graphs with girth at least 7 | 2010-10-11 | Paper |
| Game chromatic number of toroidal grids | 2010-09-01 | Paper |
| Homomorphisms of 2-edge-colored graphs | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576668 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576724 | 2010-07-30 | Paper |
| On acyclic 4-choosability of planar graphs without short cycles | 2010-07-07 | Paper |
| Perfect matchings with restricted intersection in cubic graphs | 2010-06-17 | 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 |
| Some bounds on the injective chromatic number of graphs | 2010-03-29 | Paper |
| Acyclic coloring of graphs of maximum degree five: nine colors are enough | 2010-03-24 | Paper |
| Three-coloring planar graphs without short cycles | 2010-01-29 | Paper |
| Injective Oriented Colourings | 2010-01-21 | Paper |
| A note on 2-facial coloring of plane graphs | 2010-01-18 | Paper |
| Star coloring of sparse graphs | 2009-12-18 | Paper |
| Linear coloring of planar graphs with large girth | 2009-12-15 | 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 |
| Injective coloring of planar graphs | 2009-06-30 | Paper |
| Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable | 2009-06-23 | Paper |
| Antibandwidth and cyclic antibandwidth of meshes and hypercubes | 2009-06-19 | Paper |
| Acyclic and \(k\)-distance coloring of the grid | 2009-04-28 | Paper |
| On the oriented chromatic number of grids | 2009-03-23 | Paper |
| An upper bound on adaptable choosability of graphs | 2009-03-04 | Paper |
| Projective, affine, and abelian colorings of cubic graphs | 2009-01-27 | Paper |
| Linear choosability of graphs | 2008-07-11 | Paper |
| Homomorphisms of 2-edge-colored graphs | 2008-06-05 | Paper |
| On the vertex-arboricity of planar graphs | 2008-05-13 | Paper |
| On Injective Colourings of Chordal Graphs | 2008-04-15 | Paper |
| Vertex labeling and routing in expanded Apollonian networks | 2008-02-04 | Paper |
| List circular coloring of trees and cycles | 2007-07-30 | Paper |
| Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable | 2007-07-02 | Paper |
| \(L(p,q)\) labeling of \(d\)-dimensional grids | 2007-06-26 | Paper |
| \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree | 2007-06-26 | Paper |
| Neighborhood Communications in Networks | 2007-05-29 | Paper |
| Abelian Colourings of Cubic Graphs | 2007-05-29 | Paper |
| Non-intersecting perfect matchings in cubic graphs (Extended abstract) | 2007-05-29 | Paper |
| Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract | 2007-05-29 | Paper |
| Acyclic 5-choosability of planar graphs without small cycles | 2007-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424774 | 2007-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424893 | 2007-03-05 | Paper |
| On the strong circular 5‐flow conjecture | 2006-09-06 | Paper |
| On the acyclic choosability of graphs | 2006-05-16 | Paper |
| Bordeaux 3-color conjecture and 3-choosability | 2006-05-16 | Paper |
| (d,1)-total labeling of graphs with a given maximum average degree | 2006-03-24 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Planar graphs without cycles of length from 4 to 7 are 3-colorable | 2005-03-08 | Paper |
| Star coloring of graphs | 2005-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4814349 | 2004-09-07 | Paper |
| A survey on Knödel graphs. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448754 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448760 | 2004-02-18 | Paper |
| Antisymmetric flows and edge-connectivity | 2004-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431353 | 2003-10-21 | Paper |
| A sufficient condition for planar graphs to be 3-colorable | 2003-08-25 | Paper |
| Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces | 2003-06-15 | Paper |
| Minimum feedback vertex set and acyclic coloring. | 2003-01-21 | Paper |
| Colored homomorphisms of colored mixed graphs | 2002-12-10 | Paper |
| On deeply critical oriented graphs | 2002-12-10 | Paper |
| Nilpotent families of endomorphisms of \((\mathcal P(V)^+,\cup)\) | 2002-12-10 | Paper |
| Acyclic colouring of 1-planar graphs | 2002-11-06 | Paper |
| On nice graphs | 2002-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766678 | 2002-07-22 | Paper |
| Acyclic list 7‐coloring of planar graphs | 2002-07-11 | Paper |
| All-to-all wavelength-routing in all-optical compound networks | 2002-01-21 | Paper |
| On universal graphs for planar oriented graphs of a given girth | 2000-11-02 | Paper |
| Acyclic \(k\)-strong coloring of maps on surfaces | 2000-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936748 | 2000-01-31 | Paper |
| On the maximum average degree and the oriented chromatic number of a graph | 1999-11-29 | Paper |
| Antisymmetric flows and strong colourings of oriented graphs | 1999-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232791 | 1999-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232778 | 1999-03-15 | Paper |
| Periodic gossiping in back-to-back trees | 1998-03-10 | Paper |
| On bandwidth, cutwidth, and quotient graphs | 1997-11-16 | Paper |
| Colorings and girth of oriented planar graphs | 1997-10-26 | Paper |
| Cutwidth of the de Bruijn graph | 1997-10-08 | Paper |
| Hamiltonian properties and the bipartite independence number | 1997-06-09 | Paper |
| Fulkerson's conjecture and circuit covers | 1995-05-03 | Paper |
| Good and semi-strong colorings of oriented planar graphs | 1994-09-25 | Paper |
| Two edge-disjoint hamiltonian cycles in the butterfly graph | 1994-09-25 | Paper |
| Postman tours and cycle covers | 1993-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027189 | 1993-02-21 | Paper |
| Cycle covers of graphs with a nowhere-zero 4-flow | 1992-06-27 | Paper |
| Covering the vertices of a digraph by cycles of prescribed length | 1992-06-25 | Paper |
| Short circuit covers for regular matroids with a nowhere zero 5-flow | 1987-01-01 | Paper |
