| Publication | Date of Publication | Type |
|---|
Product structure of graph classes with bounded treewidth
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
| Product structure of graph classes with bounded treewidth | 2024-10-31 | Paper |
Ubiquity of locally finite graphs with extensive tree-decompositions
Combinatorial Theory | 2024-10-08 | Paper |
A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups
Journal of the London Mathematical Society | 2024-02-23 | Paper |
Ubiquity of graphs with nowhere‐linear end structure
Journal of Graph Theory | 2023-10-12 | Paper |
On the infinite Lucchesi–Younger conjecture I
Journal of Graph Theory | 2023-10-04 | Paper |
Graphs of linear growth have bounded treewidth
The Electronic Journal of Combinatorics | 2023-08-10 | Paper |
| Odd-Minors I: Excluding small parity breaks | 2023-04-10 | Paper |
Matching variables to equations in infinite linear equation systems
Linear Algebra and its Applications | 2023-01-04 | Paper |
Counting cliques in 1-planar graphs
European Journal of Combinatorics | 2022-12-28 | Paper |
Disjoint dijoins for classes of dicuts in finite and infinite digraphs
Combinatorial Theory | 2022-11-23 | Paper |
Topological ubiquity of trees
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
Characterising \(k\)-connected sets in infinite graphs
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
| A unified Erd\H{o}s-P\'{o}sa theorem for cycles in graphs labelled by multiple abelian groups | 2022-09-20 | Paper |
| Product structure of graph classes with bounded treewidth | 2022-06-06 | Paper |
Obstructions for bounded branch-depth in matroids
Advances in Combinatorics | 2021-11-05 | Paper |
Enlarging vertex-flames in countable digraphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
Base partition for mixed families of finitary and cofinitary matroids
Combinatorica | 2021-06-29 | Paper |
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
Journal of Combinatorial Theory. Series B | 2021-06-18 | Paper |
Representations of infinite tree sets
Order | 2021-04-16 | Paper |
An analogue of Edmonds' branching theorem for infinite digraphs
European Journal of Combinatorics | 2021-02-08 | Paper |
| Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions | 2020-12-23 | Paper |
| Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure | 2018-09-03 | Paper |
Infinite end-devouring sets of rays with prescribed start vertices
Discrete Mathematics | 2018-05-24 | Paper |
Canonical tree-decompositions of a graph that display its \(k\)-blocks
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Linear bounds on treewidth in terms of excluded planar minors
(available as arXiv preprint) | N/A | Paper |
