Reinhard Diestel

Jakob Kneip

Order, 2020

Tangles: a new paradigm for clusters and types.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Structural submodularity and tangles in abstract separation systems.

[BibT_eX]

[DOI]

Joshua Erde

Daniel Weißauer

J. Comb. Theory A, 2019

Tangles in the social sciences.

[BibT_eX]

[DOI]

CoRR, 2019

Tangle-Tree Duality: In Graphs, Matroids and Beyond.

[BibT_eX]

[DOI]

Sang-il Oum

Comb., 2019

Profiles of Separations: in Graphs, Matroids, and Beyond.

[BibT_eX]

[DOI]

Fabian Hundertmark

Sahar Lemanczyk

Comb., 2019

2018

Tree Sets.

[BibT_eX]

[DOI]

Order, 2018

Abstract Separation Systems.

[BibT_eX]

[DOI]

Order, 2018

Connected Tree-Width.

[BibT_eX]

[DOI]

Malte Müller

Comb., 2018

2017

Duality Theorems for Blocks and Tangles in Graphs.

[BibT_eX]

[DOI]

Philipp Eberenz

Joshua Erde

SIAM J. Discret. Math., 2017

Dual trees must share their ends.

[BibT_eX]

[DOI]

Julian Pott

J. Comb. Theory B, 2017

2016

Canonical tree-decompositions of finite graphs II. Essential parts.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Canonical tree-decompositions of finite graphs I. Existence and algorithms.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

The structure of 2-separations of infinite matroids.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Luke Postle

J. Comb. Theory B, 2016

Tangles and the Mona Lisa.

[BibT_eX]

[DOI]

Geoff Whittle

CoRR, 2016

A Simple Existence Criterion for Normal Spanning Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

2015

Forcing Finite Minors in Sparse Infinite Graphs by Large-Degree Assumptions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

k-Blocks: A Connectivity Invariant for Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Orthogonality and Minimality in the Homology of Locally Finite Graphs.

[BibT_eX]

[DOI]

Julian Pott

Electron. J. Comb., 2014

Connectivity and tree structure in finite graphs.

[BibT_eX]

[DOI]

Comb., 2014

Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract).

[BibT_eX]

[DOI]

Sang-il Oum

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2012

The Erdős-Pósa property for clique minors in highly connected graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Paul Wollan

J. Comb. Theory B, 2012

On the excluded minor structure theorem for graphs of large tree-width.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Theodor Müller

Paul Wollan

J. Comb. Theory B, 2012

Locally finite graphs with ends: A topological approach, III. Fundamental group and homology.

[BibT_eX]

[DOI]

Philipp Sprüssel

Discret. Math., 2012

Graph Theory, 4th Edition.

[BibT_eX]

Graduate texts in mathematics 173, Springer, ISBN: 978-3-642-14278-9, 2012

2011

Twins of rayless graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Decomposing infinite matroids into their 3-connected minors.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Luke Postle

Electron. Notes Discret. Math., 2011

Locally finite graphs with ends: A topological approach, I. Basic theory.

[BibT_eX]

[DOI]

Discret. Math., 2011

Infinite matroids in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Locally finite graphs with ends: A topological approach, II. Applications.

[BibT_eX]

[DOI]

Discret. Math., 2010

The homology of a locally finite graph with ends.

[BibT_eX]

[DOI]

Philipp Sprüssel

Comb., 2010

2009

MacLane's theorem for arbitrary surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Every rayless graph has an unfriendly partition.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Philipp Sprüssel

Electron. Notes Discret. Math., 2009

2006

A Cantor-Bernstein Theorem for Paths in Graphs.

[BibT_eX]

[DOI]

Carsten Thomassen

Am. Math. Mon., 2006

End spaces and spanning trees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

Duality in Infinite Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs.

[BibT_eX]

[DOI]

Comb., 2006

Graphentheorie (3. Aufl.).

[BibT_eX]

Springer, ISBN: 978-3-540-21391-8, 2006

2005

Menger's theorem for infinite graphs with ends.

[BibT_eX]

[DOI]

Maya Stein

J. Graph Theory, 2005

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.

[BibT_eX]

[DOI]

Maya Stein

J. Graph Theory, 2005

The Erdös-Menger conjecture for source/sink sets with disjoint closures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Graph minor hierarchies.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

The Cycle Space of an Infinite Graph.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2005

2004

On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting.

[BibT_eX]

[DOI]

Am. Math. Mon., 2004

Topological paths, cycles and spanning trees in infinite graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Dense Minors In Graphs Of Large Girth.

[BibT_eX]

[DOI]

Christof Rempel

Comb., 2004

On Infinite Cycles II.

[BibT_eX]

[DOI]

Comb., 2004

On Infinite Cycles I.

[BibT_eX]

[DOI]

Comb., 2004

2003

On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.

[BibT_eX]

[DOI]

Oleg Pikhurko

Order, 2003

Graph-theoretical versus topological ends of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

The countable Erds-Menger conjecture with ends.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

2002

Two Short Proofs Concerning Tree-Decompositions.

[BibT_eX]

[DOI]

Patrick Bellenbaum

Comb. Probab. Comput., 2002

2001

Relating Subsets of a Poset, and a Partition Theorem for WQOs.

[BibT_eX]

[DOI]

Order, 2001

2000

An accessibility theorem for infinite graph minors.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

1999

A universal planar graph under the minor relation.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Excluding a Countable Clique.

[BibT_eX]

[DOI]

Robin Thomas

J. Comb. Theory B, 1999

Highly Connected Sets and the Excluded Grid Theorem.

[BibT_eX]

[DOI]

Tommy R. Jensen

Konstantin Yu. Gorbunov

Carsten Thomassen

J. Comb. Theory B, 1999

1995

Graph Minors 1: A Short Proof of the Path-width Theorem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1995

1994

Domination Games on Infinite Graphs.

[BibT_eX]

[DOI]

Imre Leader

Theor. Comput. Sci., 1994

The Depth-First Search Tree Structure of TKaleph0-Free Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

The Growth of Infinite Graphs: Boundedness and Finite Spreading.

[BibT_eX]

[DOI]

Imre Leader

Comb. Probab. Comput., 1994

Menger's Theorem for a Countable Source Set.

[BibT_eX]

[DOI]

Ron Aharoni

Comb. Probab. Comput., 1994

1992

The structure of TKa-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

On spanning trees and k-connectedness in infinite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

The end structure of a graph: recent results and open problems.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Decomposing infinite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Preface.

[BibT_eX]

[DOI]

Discret. Math., 1991

Dominating functions and topological graph minors.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1990

Simplicial tree-decompositions of infinite graphs, I.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

1989

Simplicial decompositions of graphs: a survey of applications.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Tree-decompositions, tree-representability and chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 1988

1987

A separation property of planar triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Simplicial decompositions of graphs - Some uniqueness results.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

1985

On Universal Graphs With Forbidden Topological Subgraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

On the problem of finding small subdivision and homomorphism bases for classes of countable graphs.

[BibT_eX]

[DOI]

Discret. Math., 1985

Some remarks on universal graphs.

[BibT_eX]

[DOI]