| Publication | Date of Publication | Type |
|---|
| The number of spanning trees in 4-regular simple graphs | 2025-01-27 | Paper |
| Genome galaxy identified by the circular code theory | 2024-12-20 | Paper |
| On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6134947 | 2023-08-23 | Paper |
| Reading frame retrieval of genes: a new parameter of codon usage based on the circular code theory | 2023-03-07 | Paper |
| The minimum number of spanning trees in regular multigraphs | 2023-01-11 | Paper |
| Fractional chromatic number, maximum degree, and girth | 2021-12-01 | Paper |
| Bipartite independence number in graphs with bounded maximum degree | 2021-06-10 | Paper |
| On fractional fragility rates of graph classes | 2020-10-20 | Paper |
| A 4-choosable graph that is not \((8:2)\)-choosable | 2020-10-20 | Paper |
| The relation between \(k\)-circularity and circularity of codes | 2020-08-27 | Paper |
| Eccentricity of networks with structural constraints | 2020-08-26 | Paper |
| An algorithmic framework for colouring locally sparse graphs | 2020-04-15 | Paper |
| Graph structure via local occupancy | 2020-03-31 | Paper |
| Revisiting a theorem by Folkman on graph colouring | 2020-03-30 | Paper |
| Mixed circular codes | 2020-02-17 | Paper |
| Variations on the Petersen colouring conjecture | 2020-01-17 | Paper |
| Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars | 2019-10-15 | Paper |
| On generalized choice and coloring numbers | 2019-03-22 | Paper |
| Extension from precoloured sets of edges | 2018-08-15 | Paper |
| Expander graphs and sieving in combinatorial structures | 2018-07-11 | Paper |
| Equitable colorings of \(K_4\)-minor-free graphs | 2017-10-24 | Paper |
| Limits of order types | 2017-10-10 | Paper |
| Do triangle-free planar graphs have exponentially many 3-colorings? | 2017-09-08 | Paper |
| A note on acyclic vertex-colorings | 2016-11-22 | Paper |
| Closeness Centralization Measure for Two-mode Data of Prescribed Sizes | 2016-08-14 | Paper |
| Fractional coloring of triangle-free planar graphs | 2015-11-02 | Paper |
| Toward more localized local algorithms, removing assumptions concerning global knowledge | 2015-09-11 | Paper |
| Supersaturation in the Boolean lattice | 2015-07-09 | Paper |
| Two-floor buildings need eight colors | 2015-01-27 | Paper |
| Collaborative search on the plane without communication | 2014-12-05 | Paper |
| Extensions of fractional precolorings show discontinuous behavior | 2014-11-17 | Paper |
| Extensions of fractional precolorings show discontinuous behavior | 2014-11-17 | Paper |
| Randomly colouring graphs (a combinatorial view) | 2014-10-07 | Paper |
| Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\) | 2014-07-28 | Paper |
| Transversals of Longest Paths and Cycles | 2014-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420012 | 2014-06-11 | Paper |
| Toward more localized local algorithms: removing assumptions concerning global knowledge | 2014-03-28 | Paper |
| A tight bound on the set chromatic number | 2013-11-11 | Paper |
| Circular edge-colorings of cubic graphs with girth six | 2013-10-10 | Paper |
| Multiple Petersen subdivisions in permutation graphs | 2013-06-07 | Paper |
| A new bound for the 2/3 conjecture | 2013-05-13 | Paper |
| Min-max relations for odd cycles in planar graphs | 2013-01-04 | Paper |
| A new lower bound based on Gromov's method of selecting heavily covered points | 2012-09-19 | Paper |
| Griggs and Yeh's conjecture and \(L(p,1)\)-labelings | 2012-08-22 | Paper |
| Every plane graph of maximum degree 8 has an edge-face 9-coloring | 2011-10-27 | Paper |
| Characterization of graphs and digraphs with small process numbers | 2011-08-10 | Paper |
| Equitable coloring of sparse planar graphs | 2011-07-18 | Paper |
| Edge-face coloring of plane graphs with maximum degree nine | 2011-04-19 | Paper |
| The last fraction of a fractional conjecture | 2011-04-15 | Paper |
| Graphs with four boundary vertices | 2011-02-17 | Paper |
| The fractional chromatic number of Zykov products of graphs | 2011-01-20 | Paper |
| Improper coloring of unit disk graphs | 2010-11-24 | Paper |
| Graphs with bounded tree-width and large odd-girth are almost bipartite | 2010-11-05 | Paper |
| A new lower bound on the number of perfect matchings in cubic graphs | 2010-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579493 | 2010-08-06 | Paper |
| Improper colouring of (random) unit disk graphs | 2010-07-30 | Paper |
| Circular edge-colorings of cubic graphs with girth six | 2010-06-03 | Paper |
| A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs | 2010-06-01 | Paper |
| Facial colorings using Hall's theorem | 2010-04-27 | Paper |
| On the sextet polynomial of fullerenes | 2010-04-26 | Paper |
| Identifying and locating-dominating codes in (random) geometric networks | 2010-04-23 | Paper |
| Characterisation results for Steiner triple systems and their application to edge-colourings of cubic graphs | 2010-03-31 | Paper |
| Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree | 2010-03-29 | Paper |
| Circular choosability | 2009-12-18 | Paper |
| A note on antisymmetric flows in graphs | 2009-12-01 | Paper |
| Total-Coloring of Plane Graphs with Maximum Degree Nine | 2009-11-27 | Paper |
| Fullerene graphs have exponentially many perfect matchings | 2009-09-02 | Paper |
| Long cycles in fullerene graphs | 2009-09-02 | Paper |
| 3-Facial Coloring of Plane Graphs | 2009-03-16 | Paper |
| About a Brooks-type theorem for improper colouring | 2009-03-16 | Paper |
| List colorings with measurable sets | 2009-02-20 | Paper |
| Lower bounding the boundary of a graph in terms of its maximum or minimum degree | 2009-01-28 | Paper |
| Projective, affine, and abelian colorings of cubic graphs | 2009-01-27 | Paper |
| Orders with ten elements are circle order | 2009-01-26 | Paper |
| Graphs with full rank 3-color matrix and few 3-colorings | 2008-10-07 | Paper |
| Guarding Art Galleries: The Extra Cost for Sculptures Is Linear | 2008-07-15 | Paper |
| Characterization of affine Steiner triple systems and Hall triple systems | 2008-06-05 | Paper |
| Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems | 2008-06-05 | Paper |
| Improper colouring of (random) unit disk graphs | 2008-03-18 | Paper |
| Pathwidth of outerplanar graphs | 2007-06-11 | Paper |
| Two proofs of Bermond-Thomassen conjecture for regular tournaments | 2007-05-29 | Paper |
| Improper Colourings of Unit Disk Graphs | 2007-05-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Improper choosability of graphs and maximum average degree | 2006-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4670086 | 2005-04-15 | Paper |
