| Publication | Date of Publication | Type |
|---|
| On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph | 2024-02-23 | Paper |
| Improved pyrotechnics: closer to the burning number conjecture | 2024-02-16 | Paper |
| On a recolouring version of Hadwiger's conjecture | 2024-01-29 | Paper |
| Edge-colouring graphs with local list sizes | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6061695 | 2023-12-08 | Paper |
| Optimal labelling schemes for adjacency, comparability, and reachability | 2023-11-14 | Paper |
| Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable | 2023-10-10 | Paper |
| Partitioning edges of a planar graph into linear forests and a matching | 2023-10-05 | Paper |
| Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration | 2023-10-04 | Paper |
| Tuza's Conjecture for Threshold Graphs | 2023-05-30 | Paper |
| Shortest Reconfiguration of Colorings Under Kempe Changes | 2023-02-07 | Paper |
| Separating the edges of a graph by a linear number of paths | 2023-01-20 | Paper |
| On Vizing's edge colouring question | 2023-01-04 | Paper |
| EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5051743 | 2022-11-18 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2022-09-21 | Paper |
| Distributed Recoloring | 2022-07-21 | Paper |
| The Perfect Matching Reconfiguration Problem | 2022-07-21 | Paper |
| Enumerating Minimal Dominating Sets in Triangle-Free Graphs | 2022-07-18 | Paper |
| Colouring graphs with sparse neighbourhoods: bounds and applications | 2022-04-27 | Paper |
| Kempe changes in degenerate graphs | 2021-12-04 | Paper |
| Limiting Crossing Numbers for Geodesic Drawings on the Sphere | 2021-12-01 | Paper |
| Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs | 2021-11-17 | Paper |
| Jones' conjecture in subcubic graphs | 2021-10-26 | Paper |
| Gallai's path decomposition in planar graphs | 2021-10-17 | Paper |
| A note on connected greedy edge colouring | 2021-09-30 | Paper |
| Frozen (Δ + 1)-colourings of bounded degree graphs | 2021-06-15 | Paper |
| Dominating sets reconfiguration under token sliding | 2021-06-14 | Paper |
| A note on deterministic zombies | 2021-06-14 | Paper |
| Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants | 2021-05-03 | Paper |
| Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy | 2021-04-08 | Paper |
| Shorter Labeling Schemes for Planar Graphs | 2021-02-02 | Paper |
| The interactive sum choice number of graphs | 2021-02-01 | Paper |
| Avoidable paths in graphs | 2020-12-13 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
| Independent Feedback Vertex Set for P_5-free Graphs | 2020-11-25 | Paper |
| Graphs of bounded cliquewidth are polynomially $χ$-bounded | 2020-10-20 | Paper |
| Fractional vertex-arboricity of planar graphs | 2020-09-25 | Paper |
| Diameter of colorings under Kempe changes | 2020-09-01 | Paper |
| Limiting crossing numbers for geodesic drawings on the sphere | 2020-08-24 | Paper |
| Surfaces have (asymptotic) dimension 2 | 2020-07-07 | Paper |
| Tight Lower Bounds for the Complexity of Multicoloring | 2020-05-27 | Paper |
| Recognizing Graphs Close to Bipartite Graphs | 2020-05-26 | Paper |
| Partitioning the vertices of a torus into isomorphic subgraphs | 2020-04-27 | Paper |
| Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets | 2020-04-15 | Paper |
| Revisiting a theorem by Folkman on graph colouring | 2020-03-30 | Paper |
| Diameter of colorings under Kempe changes | 2020-02-24 | Paper |
| Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy | 2020-01-16 | Paper |
| Tight Lower Bounds for the Complexity of Multicoloring | 2019-12-16 | Paper |
| Distributed coloring in sparse graphs with fewer colors | 2019-11-15 | Paper |
| Distributed Coloring in Sparse Graphs with Fewer Colors | 2019-09-19 | Paper |
| On the difference between the Szeged and the Wiener index | 2019-04-29 | Paper |
| Independent feedback vertex set for \(P_5\)-free graphs | 2019-04-25 | Paper |
| Gallai's path decomposition conjecture for graphs of small maximum degree | 2019-03-25 | Paper |
| On a conjecture of Mohar concerning Kempe equivalence of regular graphs | 2019-02-08 | Paper |
| Planar graphs of girth at least five are square \((\delta + 2)\)-choosable | 2018-12-20 | Paper |
| Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy | 2018-11-29 | Paper |
| On directed feedback vertex set parameterized by treewidth | 2018-11-22 | Paper |
| Frozen colourings of bounded degree graphs | 2018-10-11 | Paper |
| The interactive sum choice number of graphs | 2018-01-18 | Paper |
| Token sliding on chordal graphs | 2018-01-04 | Paper |
| Recoloring graphs via tree decompositions | 2017-12-21 | Paper |
| Independent feedback vertex sets for graphs of bounded diameter | 2017-12-13 | Paper |
| Linear kernels for outbranching problems in sparse digraphs | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363775 | 2017-09-29 | Paper |
| On the Neighbor Sum Distinguishing Index of Planar Graphs | 2017-08-08 | Paper |
| Incidence coloring of graphs with high maximum average degree | 2017-06-19 | Paper |
| List Coloring with a Bounded Palette | 2017-02-01 | Paper |
| Strong edge coloring sparse graphs | 2016-10-14 | Paper |
| A \(13k\)-kernel for planar feedback vertex set via region decomposition | 2016-08-31 | Paper |
| The Erdös--Hajnal Conjecture for Long Holes and Antiholes | 2016-06-23 | Paper |
| Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable | 2016-05-24 | Paper |
| Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable | 2015-09-23 | Paper |
| A $$14k$$ -Kernel for Planar Feedback Vertex Set via Region Decomposition | 2015-09-15 | Paper |
| 2-distance coloring of sparse graphs | 2014-11-17 | Paper |
| List coloring the square of sparse graphs with large degree | 2014-09-02 | Paper |
| Graphs with large chromatic number induce $3k$-cycles | 2014-08-09 | Paper |
| Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable | 2014-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419983 | 2014-06-11 | Paper |
| Reconfiguring Independent Sets in Cographs | 2014-06-05 | Paper |
| Brooks' theorem on powers of graphs | 2014-05-06 | Paper |
| Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs | 2014-02-25 | Paper |
| Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable | 2014-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857337 | 2013-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857338 | 2013-11-01 | Paper |
| Recoloring bounded treewidth graphs | 2013-02-14 | Paper |
| Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable | 2013-01-29 | Paper |
