| Publication | Date of Publication | Type |
|---|
| A 2-stable family of triple systems | 2024-04-09 | Paper |
| Toward a density Corr\'{a}di--Hajnal theorem for degenerate hypergraphs | 2023-11-25 | Paper |
| Many vertex-disjoint even cycles of fixed length in a graph | 2023-11-25 | Paper |
| Counting triangles in graphs without vertex disjoint odd cycles | 2023-10-29 | Paper |
| On bisections of graphs without complete bipartite graphs | 2023-10-04 | Paper |
| Gallai's conjecture on path decompositions | 2023-09-12 | Paper |
| Hypergraphs with irrational Tur\'{a}n density and many extremal configurations | 2023-08-18 | Paper |
| Graph partitioning: an updated survey | 2023-08-02 | Paper |
| MaxCut in graphs with sparse neighborhoods | 2023-07-18 | Paper |
| On \(( 2 , r )\)-choosability of planar graphs without short cycles | 2023-04-21 | Paper |
| On \(L (p, q)\)-labelling of planar graphs without cycles of length four | 2023-04-21 | Paper |
| Singular Turán numbers of stars | 2023-04-05 | Paper |
| Large induced subgraphs with three repeated degrees | 2023-03-10 | Paper |
| Coloring squares of planar graphs with maximum degree at most five | 2023-03-09 | Paper |
| A step towards a general density Corr\'{a}di--Hajnal Theorem | 2023-02-20 | Paper |
| Extremal graphs for the suspension of edge-critical graphs | 2022-11-15 | Paper |
| Two stability theorems for $\mathcal{K}_{\ell + 1}^{r}$-saturated hypergraphs | 2022-11-05 | Paper |
| Generating non-jumps from a known one | 2022-08-01 | Paper |
| On judicious bipartitions of directed graphs | 2022-06-14 | Paper |
| Odd induced subgraphs in planar graphs with large girth | 2022-06-08 | Paper |
| Hypergraphs with infinitely many extremal constructions | 2022-06-08 | Paper |
| Maximum bisections of graphs without cycles of length 4 | 2022-05-27 | Paper |
| On \((3, r)\)-choosability of some planar graphs | 2022-03-21 | Paper |
| Coloring graphs without bichromatic cycles or paths | 2021-08-12 | Paper |
| Uniform tight frames as optimal signals | 2021-07-15 | Paper |
| Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs | 2021-03-18 | Paper |
| Choosability with union separation of planar graphs without cycles of length 4 | 2021-03-16 | Paper |
| Choosability with union separation of triangle-free planar graphs | 2020-10-08 | Paper |
| A bound on judicious bipartitions of directed graphs | 2020-03-06 | Paper |
| Max-bisections of \(H\)-free graphs | 2019-12-12 | Paper |
| On bipartitions of directed graphs with small semidegree | 2019-11-28 | Paper |
| Maximum cuts of graphs with forbidden cycles | 2019-02-01 | Paper |
| On partitions of \(K_{2, 3}\)-free graphs under degree constraints | 2018-10-23 | Paper |
| Graphs of \(f\)-class 1 | 2018-09-25 | Paper |
| Bipartitions of oriented graphs | 2018-07-24 | Paper |
| The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs | 2018-02-22 | Paper |
| Partitioning dense uniform hypergraphs | 2018-02-21 | Paper |
| Bisections of Graphs Without Short Cycles | 2018-01-19 | Paper |
| Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 | 2017-10-10 | Paper |
| Bounds for the number of meeting edges in graph partitioning | 2017-09-06 | Paper |
| On a Problem of Judiciousk-Partitions of Graphs | 2017-08-08 | Paper |
| BIPARTITE SUBGRAPHS OF -FREE GRAPHS | 2017-08-07 | Paper |
| On bisections of directed graphs | 2017-06-19 | Paper |
| Biased partitions and judicious \(k\)-partitions of graphs | 2017-06-01 | Paper |
| Monochromatic solutions for multi-term unknowns | 2017-01-13 | Paper |
| Bounds for pairs in judicious partitioning of graphs | 2017-01-10 | Paper |
| On judicious partitions of uniform hypergraphs | 2016-04-20 | Paper |
| Acyclic coloring of graphs without bichromatic long path | 2015-11-06 | Paper |
| On total colorings of 1-planar graphs | 2015-07-01 | Paper |
| A bound for judicious \(k\)-partitions of graphs | 2014-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2924785 | 2014-11-03 | Paper |
| Acyclic edge coloring of planar graphs with girth at least 5 | 2014-04-23 | Paper |
| Every toroidal graph is acyclically 8-choosable | 2014-03-18 | Paper |
| Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs” | 2013-04-19 | Paper |
| An improved bound on acyclic chromatic index of planar graphs | 2013-04-17 | Paper |
| Acyclic chromatic index of planar graphs with triangles | 2013-04-04 | Paper |
| List total colorings of planar graphs without triangles at small distance | 2013-03-18 | Paper |
| Acyclic edge coloring of planar graphs without small cycles | 2012-12-27 | Paper |
| A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS | 2012-10-15 | Paper |
| A Planar linear arboricity conjecture | 2012-06-13 | Paper |
| On the total choosability of planar graphs and of sparse graphs | 2012-03-27 | Paper |
| Acyclic edge coloring of sparse graphs | 2012-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3115075 | 2012-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5199842 | 2011-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3011725 | 2011-06-29 | Paper |
| Local condition for planar graphs of maximum degree 7 to be 8-totally colorable | 2011-05-17 | Paper |
| Improved bounds for acyclic chromatic index of planar graphs | 2011-05-17 | Paper |
| The method of coloring in graphs and its application | 2011-04-05 | Paper |
| Total coloring of embedded graphs of maximum degree at least ten | 2011-02-25 | Paper |
| Total coloring of planar graphs without 6-cycles | 2011-01-21 | Paper |
| Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles | 2011-01-20 | Paper |
| Acyclic edge chromatic number of outerplanar graphs | 2010-11-10 | Paper |
| Edge-choosability of planar graphs without non-induced 5-cycles | 2010-06-16 | Paper |
| List edge and list total colorings of planar graphs without short cycles | 2010-06-09 | Paper |
| A Planar linear arboricity conjecture | 2010-05-28 | Paper |
| Total colorings and list total colorings of planar graphs without intersecting 4-cycles | 2009-12-15 | Paper |
| Acyclic edge colorings of planar graphs and series parallel graphs | 2009-12-07 | Paper |
| Acyclic edge coloring of planar graphs with large girth | 2009-11-06 | Paper |
| The stability number and connected \([k,k+1\)-factor in graphs] | 2009-06-10 | Paper |
| Edge-choosability of planar graphs without adjacent triangles or without 7-cycles | 2009-01-28 | Paper |
| Total colorings of planar graphs without adjacent triangles | 2009-01-28 | Paper |
| Binding number and Hamiltonian (g, f)-factors in graphs II | 2008-09-24 | Paper |
| Total colorings of planar graphs without small cycles | 2008-08-20 | Paper |
| Some results about f‐critical graphs | 2008-01-07 | Paper |
| Some properties on \(f\)-edge covered critical graphs | 2007-10-22 | Paper |
| The linear arboricity of planar graphs with no short cycles | 2007-09-03 | Paper |
| List edge and list total colorings of planar graphs without 4-cycles | 2007-01-09 | Paper |
| Counting triangles in graphs without vertex disjoint odd cycles | 0001-01-03 | Paper |
| Faster coloring and embedding in dense hypergraphs via stability | 0001-01-03 | Paper |
