2020
Profinite Separation Systems.
Order, 2020
Tangles: a new paradigm for clusters and types.
CoRR, 2020
2019
Structural submodularity and tangles in abstract separation systems.
J. Comb. Theory, Ser. A, 2019
Tangles in the social sciences.
CoRR, 2019
Tangle-Tree Duality: In Graphs, Matroids and Beyond.
Comb., 2019
Profiles of Separations: in Graphs, Matroids, and Beyond.
Comb., 2019
2018
Abstract Separation Systems.
Order, 2018
2017
Duality Theorems for Blocks and Tangles in Graphs.
SIAM J. Discret. Math., 2017
Dual trees must share their ends.
J. Comb. Theory, Ser. B, 2017
2016
Canonical tree-decompositions of finite graphs II. Essential parts.
J. Comb. Theory, Ser. B, 2016
Canonical tree-decompositions of finite graphs I. Existence and algorithms.
J. Comb. Theory, Ser. B, 2016
The structure of 2-separations of infinite matroids.
J. Comb. Theory, Ser. B, 2016
Tangles and the Mona Lisa.
CoRR, 2016
A Simple Existence Criterion for Normal Spanning Trees.
Electron. J. Comb., 2016
2015
Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions.
Electron. J. Comb., 2015
2014
k-Blocks: A Connectivity Invariant for Graphs.
SIAM J. Discret. Math., 2014
Orthogonality and Minimality in the Homology of Locally Finite Graphs.
Electron. J. Comb., 2014
Connectivity and tree structure in finite graphs.
Comb., 2014
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2012
The Erdős-Pósa property for clique minors in highly connected graphs.
J. Comb. Theory, Ser. B, 2012
On the excluded minor structure theorem for graphs of large tree-width.
J. Comb. Theory, Ser. B, 2012
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology.
Discret. Math., 2012
Graph Theory, 4th Edition.
Graduate texts in mathematics 173, Springer, ISBN: 978-3-642-14278-9, 2012
2011
J. Comb. Theory, Ser. B, 2011
Decomposing infinite matroids into their 3-connected minors.
Electron. Notes Discret. Math., 2011
Locally finite graphs with ends: A topological approach, I. Basic theory.
Discret. Math., 2011
Infinite matroids in graphs.
Discret. Math., 2011
2010
Locally finite graphs with ends: A topological approach, II. Applications.
Discret. Math., 2010
The homology of a locally finite graph with ends.
Comb., 2010
2009
MacLane's theorem for arbitrary surfaces.
J. Comb. Theory, Ser. B, 2009
Every rayless graph has an unfriendly partition.
Electron. Notes Discret. Math., 2009
2006
A Cantor-Bernstein Theorem for Paths in Graphs.
Am. Math. Mon., 2006
End spaces and spanning trees.
J. Comb. Theory, Ser. B, 2006
Duality in Infinite Graphs.
Comb. Probab. Comput., 2006
Global Connectivity And Expansion: Long Cycles and Factors In <i>f</i>-Connected Graphs.
Comb., 2006
Graphentheorie (3. Aufl.).
Springer, ISBN: 978-3-540-21391-8, 2006
2005
Menger's theorem for infinite graphs with ends.
J. Graph Theory, 2005
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.
J. Graph Theory, 2005
The Erdös-Menger conjecture for source/sink sets with disjoint closures.
J. Comb. Theory, Ser. B, 2005
Discret. Appl. Math., 2005
The Cycle Space of an Infinite Graph.
Comb. Probab. Comput., 2005
2004
On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting.
Am. Math. Mon., 2004
Topological paths, cycles and spanning trees in infinite graphs.
Eur. J. Comb., 2004
Dense Minors In Graphs Of Large Girth.
Comb., 2004
2003
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order, 2003
Graph-theoretical versus topological ends of graphs.
J. Comb. Theory, Ser. B, 2003
The countable Erds-Menger conjecture with ends.
J. Comb. Theory, Ser. B, 2003
2002
Two Short Proofs Concerning Tree-Decompositions.
Comb. Probab. Comput., 2002
2001
Relating Subsets of a Poset, and a Partition Theorem for WQOs.
Order, 2001
2000
An accessibility theorem for infinite graph minors.
J. Graph Theory, 2000
1999
A universal planar graph under the minor relation.
J. Graph Theory, 1999
Excluding a Countable Clique.
J. Comb. Theory, Ser. B, 1999
Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory, Ser. B, 1999
1995
Graph Minors 1: A Short Proof of the Path-width Theorem.
Comb. Probab. Comput., 1995
1994
Domination Games on Infinite Graphs.
Theor. Comput. Sci., 1994
The Depth-First Search Tree Structure of <i>TK</i><sub>aleph0</sub>-Free Graphs.
J. Comb. Theory, Ser. B, 1994
The Growth of Infinite Graphs: Boundedness and Finite Spreading.
Comb. Probab. Comput., 1994
Menger's Theorem for a Countable Source Set.
Comb. Probab. Comput., 1994
1992
The structure of <i>TK</i><sub><i>a</i></sub>-free graphs.
J. Comb. Theory, Ser. B, 1992
On spanning trees and <i>k</i>-connectedness in infinite graphs.
J. Comb. Theory, Ser. B, 1992
The end structure of a graph: recent results and open problems.
Discret. Math., 1992
1991
Decomposing infinite graphs.
Discret. Math., 1991
Dominating functions and topological graph minors.
Proceedings of the Graph Structure Theory, 1991
1990
Simplicial tree-decompositions of infinite graphs, I.
J. Comb. Theory, Ser. B, 1990
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.
J. Comb. Theory, Ser. B, 1990
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.
J. Comb. Theory, Ser. B, 1990
1989
Simplicial decompositions of graphs: a survey of applications.
Discret. Math., 1989
1988
Tree-decompositions, tree-representability and chordal graphs.
Discret. Math., 1988
1987
A separation property of planar triangulations.
J. Graph Theory, 1987
Simplicial decompositions of graphs - Some uniqueness results.
J. Comb. Theory, Ser. B, 1987
1985
On Universal Graphs With Forbidden Topological Subgraphs.
Eur. J. Comb., 1985
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs.
Discret. Math., 1985
Some remarks on universal graphs.
Comb., 1985
