| Publication | Date of Publication | Type |
|---|
| On the irregularity of uniform hypergraphs | 2023-10-31 | Paper |
| Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs | 2023-10-05 | Paper |
| Strong edge-coloring of 2-degenerate graphs | 2023-06-05 | Paper |
| 1-planar graphs are odd 13-colorable | 2023-05-31 | Paper |
| Optimal connectivity for fat-triangle linkages | 2023-03-10 | Paper |
| Spanning tree packing and 2-essential edge-connectivity | 2022-11-02 | Paper |
| Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers | 2022-02-14 | Paper |
| Note on injective edge-coloring of graphs | 2022-02-09 | Paper |
| Open locating-dominating sets in circulant graphs | 2022-01-03 | Paper |
| Sufficient Conditions for 2-Dimensional Global Rigidity | 2021-11-04 | Paper |
| Disjoint chorded cycles in graphs with high Ore-degree | 2021-10-04 | Paper |
| Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable | 2021-09-30 | Paper |
| An improved linear connectivity bound for tournaments to be highly linked | 2021-09-02 | Paper |
| Planar graphs without short even cycles are near-bipartite | 2020-07-07 | Paper |
| Packing \(( 1 , 1 , 2 , 2 )\)-coloring of some subcubic graphs | 2020-06-29 | Paper |
| Planar graphs without 7-cycles and butterflies are DP-4-colorable | 2020-06-08 | Paper |
| DP-4-colorability of planar graphs without adjacent cycles of given length | 2020-03-23 | Paper |
| The strong edge-coloring for graphs with small edge weight | 2020-02-20 | Paper |
| Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable | 2019-12-17 | Paper |
| Recent progress on strong edge-coloring of graphs | 2019-11-07 | Paper |
| Planar graphs with girth at least 5 are \((3, 4)\)-colorable | 2019-10-17 | Paper |
| DP-4-colorability of two classes of planar graphs | 2019-09-11 | Paper |
| Minimum degree condition for a graph to be knitted | 2019-09-11 | Paper |
| Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable | 2019-08-20 | Paper |
| DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) | 2019-06-28 | Paper |
| Strong edge-coloring for planar graphs with large girth | 2018-11-29 | Paper |
| DP-3-coloring of some planar graphs | 2018-11-13 | Paper |
| Strong list-chromatic index of subcubic graphs | 2018-10-23 | Paper |
| Strong chromatic index of graphs with maximum degree four | 2018-09-07 | Paper |
| Covering 2‐connected 3‐regular graphs with disjoint paths | 2018-08-16 | Paper |
| Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable | 2018-07-20 | Paper |
| A relaxation of the strong Bordeaux Conjecture | 2018-07-13 | Paper |
| On strong edge-coloring of graphs with maximum degree 4 | 2017-12-06 | Paper |
| A note on chromatic number and induced odd cycles | 2017-11-10 | Paper |
| Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable | 2017-08-03 | Paper |
| Maximum average degree and relaxed coloring | 2017-08-01 | Paper |
| The strong chromatic index of \((3,\Delta)\)-bipartite graphs | 2017-02-27 | Paper |
| Extremal permutations in routing cycles | 2016-12-06 | Paper |
| A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation | 2016-07-27 | Paper |
| Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable | 2015-12-08 | Paper |
| Strong edge-colorings for \(k\)-degenerate graphs | 2015-09-24 | Paper |
| Optimal open-locating-dominating sets in infinite triangular grids | 2015-07-24 | Paper |
| A relaxation of the Bordeaux conjecture | 2015-06-18 | Paper |
| Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture | 2014-10-06 | Paper |
| New bounds on the minimum density of an identifying code for the infinite hexagonal grid | 2014-04-23 | Paper |
| Linear colorings of subcubic graphs | 2014-04-11 | Paper |
| Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable | 2014-01-23 | Paper |
| A Relaxation of Steinberg's Conjecture | 2013-06-27 | Paper |
| Graphs containing every 2-factor | 2012-12-27 | Paper |
| Linkage for the diamond and the path with four vertices | 2012-07-10 | Paper |
| An extremal problem on group connectivity of graphs | 2012-06-18 | Paper |
| Equitable defective coloring of sparse planar graphs | 2012-03-16 | Paper |
| Permutations as Product of Parallel Transpositions | 2012-03-15 | Paper |
| Linear choosability of sparse graphs | 2011-08-09 | Paper |
| Equitable Coloring of Sparse Planar Graphs | 2011-07-18 | Paper |
| Injective colorings of graphs with low average degree | 2011-06-30 | Paper |
| Injective colorings of sparse graphs | 2010-10-19 | Paper |
| On the Pagenumber of k-Trees | 2010-08-27 | Paper |
| On a graph packing conjecture by Bollobás, Eldridge and Catlin | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3572604 | 2010-07-08 | Paper |
| A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid | 2010-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3656238 | 2010-01-13 | Paper |
| Ore-type conditions implying 2-factors consisting of short cycles | 2009-12-15 | Paper |
| On the First-Fit Chromatic Number of Graphs | 2009-08-20 | Paper |
| Hamiltonian connectedness in 3-connected line graphs | 2009-06-30 | Paper |
| Implications among linkage properties in graphs | 2009-06-16 | Paper |
| M-degrees of quadrangle-free planar graphs | 2009-02-20 | Paper |
| Packing of graphs with small product of sizes | 2008-12-08 | Paper |
| Minimum degree conditions for \(H\)-linked graphs | 2008-09-29 | Paper |
| Ore-condition and \(Z_3\)-connectivity | 2008-09-04 | Paper |
| Decomposing a planar graph with girth 9 into a forest and a matching | 2008-05-29 | Paper |
| Ore‐type degree conditions for a graph to be H‐linked | 2008-05-14 | Paper |
| An inequality for the group chromatic number of a graph | 2007-11-30 | Paper |
| On Minimum Degree Implying That a Graph is H‐Linked | 2007-11-16 | Paper |
| An Ore-type analogue of the Sauer-Spencer theorem | 2007-10-11 | Paper |
| Minimum degree conditions for H-linked graphs | 2007-05-29 | Paper |
| Ore-type graph packing problems | 2007-03-20 | Paper |
| On extremal matrices of second largest exponent by Boolean rank | 2007-03-09 | Paper |
| On Sufficient Degree Conditions for a Graph to be $k$-linked | 2006-12-05 | Paper |
| Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity | 2006-03-20 | Paper |
| An extremal problem for H‐linked graphs | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712524 | 2001-08-30 | Paper |
