- Extremal questions in graph theory vorgelegt von
- On the homology of locally finite graphs Reinhard Diestel and Philipp Sprussel
- Global connectivity and expansion: long cycles and factors in f-connected graphs
- Ends of graphs vorgelegt von
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 92 (2004) 235256
- MacLane's theorem for arbitrary surfaces Henning Bruhn and Reinhard Diestel
- End spaces and spanning trees Reinhard Diestel
- On the Erdos-Menger conjecture with ends Henning Bruhn Reinhard Diestel Maya Stein
- Decomposing Infinite Graphs Reinhard Diestel
- Relating subsets of a poset, and a partition theorem for WQOs
- End spaces of graphs are normal Philipp Sprussel
- The homology of a locally finite graph with ends Reinhard Diestel and Philipp Sprussel
- Duality of ends Henning Bruhn and Maya Stein
- On Infinite Cycles I To the memory of C.St.J.A. Nash-Williams
- Infinite graphs with a treelike structure
- Infinite matroids in graphs Henning Bruhn Reinhard Diestel
- Twins of rayless graphs Anthony Bonato Henning Bruhn Reinhard Diestel
- Graphs and their Circuits --From Finite to Infinite--
- Graph topologies induced by edge lengths Agelos Georgakopoulos
- Topological circles and Euler tours in locally finite graphs
- Axioms for infinite matroids Henning Bruhn Reinhard Diestel Matthias Kriesell
- Connected but not path-connected subspaces of infinite graphs
- Hamilton circles in planar locally finite graphs Henning Bruhn Xingxing Yu
- The fundamental group of a locally finite graph with ends
- Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs
- Partitions and orientations of the Rado graph
- Dominating functions and topological graph minors
- On the homology of infinite graphs with ends
- On the homology of locally compact spaces with ends Reinhard Diestel and Philipp Sprussel
- Locally finite graphs with ends: a topological approach Reinhard Diestel
- 8.4 Connectivity and matching 235 Theorem 8.4.12 there is a set T V (C) such that CC-T is not matchable
- The cycle space of an infinite graph Reinhard Diestel
- Eulerian edge sets in locally finite graphs Eli Berger and Henning Bruhn
- Bicycles and left-right tours in locally finite Henning Bruhn Stefanie Kosuch Melanie Win Myint
- Geodetic topological cycles in locally finite graphs
- Duality in infinite graphs Henning Bruhn Reinhard Diestel
- On end degrees and infinite cycles in locally finite graphs
- Topological Paths, Cycles and Spanning Trees in Infinite Graphs
- On Infinite Cycles II To the memory of C.St.J.A. Nash-Williams
- Infinite Hamilton Cycles in Squares of Locally Finite Graphs
- Forcing highly connected subgraphs Maya Jakobine Stein
- Florian LEHNER The Line Graph of Every Locally
- Bicycles and Left-Right Tours in Locally Finite Graphs
- Topological paths and cycles in infinite graphs
- Infinite circuits in locally finite graphs
- Connectivity and tree structure in finite graphs
- The Erdos-Posa property for clique minors in highly connected graphs
- Every rayless graph has an unfriendly partition Henning Bruhn Reinhard Diestel
- Embedding graphs in surfaces: MacLane's theorem for higher genus
- 12.4 Tree-width and forbidden minors 259 Proof . By Lemma 12.3.4, we have tw(K4
- A short proof of Halin's grid theorem Rudolf Halin zum 70. Geburtstag
- An Accessibility Theorem for Infinite Graph Minors Reinhard Diestel
- Normal Spanning Trees, Aronszajn Trees and Excluded Minors Reinhard Diestel and Imre Leader
- The Structure of TKa-free Graphs Reinhard Diestel, Cambridge
- The Classification of Finitely Spreading Graphs Reinhard Diestel
- The Growth of Infinite Graphs: Boundedness and Finite Spreading
- A Proof of the Bounded Graph Conjecture Reinhard Diestel and Imre Leader
- Decomposition Duality Reinhard Diestel
- Menger's theorem for infinite graphs with ends Henning Bruhn Reinhard Diestel Maya Stein
- On End-faithful Spanning Trees in Infinite Graphs
- A conjecture concerning a limit of non-Cayley graphs
- Manuscript Number: Elsevier Inc. Licence Agreement
- Licence to publish in the Proceedings of the London Mathematical Society Please read the terms of this licence and then complete, sign and return this form as soon as
- MAA CONSENT TO PUBLISH AGREEMENT It is required that Author(s) who wish to retain copyright of the content and image of
- Graph Minor Hierarchies Reinhard Diestel & Daniela Kuhn
- Bases and closures under infinite sums Henning Bruhn Agelos Georgakopoulos
- Dual trees must share their ends Reinhard Diestel Julian Pott
- Two short proofs concerning tree-decompositions Patrick Bellenbaum & Reinhard Diestel
- On the excluded minor structure theorem for graphs of large treewidth
- 605 Third Avenue New York, NY 10158-0012
- Journal of Combinatorial Theory, Series B 96 (2006) 302312 www.elsevier.com/locate/jctb
- Journal of Combinatorial Theory, Series B 96 (2006) 225239 www.elsevier.com/locate/jctb
- A Cantor-Bernstein theorem for paths in graphs Reinhard Diestel & Carsten Thomassen
- Consent to Publish AMERICAN MATHEMATICAL SOCIETY
- Excluding a countable clique Reinhard Diestel
- Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
- Dense minors in graphs of large girth Reinhard Diestel & Christof Rempel
- Extremal Infinite Graph Theory November 25, 2010
- Menger's theorem for a countable source set Ron Aharoni and Reinhard Diestel
- An Accessibility Theorem for Infinite Graph Minors Reinhard Diestel
- Menger's theorem for infinite graphs with ends Henning Bruhn Reinhard Diestel Maya Stein
- On vertex transitive graphs of infinite degree R. Diestel, H.A. Jung, R.G. M"oller
- Every rayless graph has an unfriendly partition Henning Bruhn Reinhard Diestel
- The Erd"os-Menger conjecture for source/sink sets with disjoint closures
- The End Structure of a Graph: Recent Results and Open Problems
- NOTE Decomposition Duality
- Domination Games on Infinite Graphs Reinhard Diestel and Imre Leader
- SIMPLICIAL MINORS AND DECOMPOSITIONS OF GRAPHS Reinhard Diestel, Cambridge
- Highly connected sets and the excluded grid theorem
- Simplicial Decompositions, Tree-decompositions and Graph Minors
- A short proof of the path-width theorem Reinhard Diestel
- Decompositions of Infinite Graphs into Small Induced Subgraphs
- Normal tree orders for infinite graphs J.-M. Brochet and R. Diestel
- Relating subsets of a poset, and a partition theorem for WQOs
- SIMPLICIAL TREE-DECOMPOSITIONS OF INFINITE GRAPHS III The Uniqueness of Prime Decompositions
- A universal planar graph under the minor relation Reinhard Diestel Daniela Kuhn
- Simplicial Decompositions, Tree-decompositions and Graph Minors
- The countable Erdos-Menger conjecture with ends Reinhard Diestel
- The Erdos-Menger conjecture for source/sink sets with disjoint closures
- Graph-theoretical versus topological ends of graphs Reinhard Diestel & Daniela Kuhn
- Partitions and orientations of the Rado graph
- End spaces and spanning trees Reinhard Diestel
- On Spanning Trees and k-connectedness in Infinite Graphs
- On the Erd"os-Menger conjecture with ends Henning Bruhn Reinhard Diestel Maya Stein
- Simplicial decompositions of graphs: a survey of applications
- Dominating Functions and Graphs Reinhard Diestel Saharon Shelah* Juris Stepr~ans
- SIMPLICIAL TREE-DECOMPOSITIONS OF INFINITE GRAPHS I Reinhard Diestel
- The depth-first search tree structure of TK@0 -free graphs
- A compactness theorem for complete separators Reinhard Diestel, Cambridge
- SIMPLICIAL TREE-DECOMPOSITIONS OF INFINITE GRAPHS II The Existence of Prime Decompositions
- Not a Certificate for Bounded Graphs: a Counterexample to a Conjecture of Thomassen
- A Proof of the Bounded Graph Conjecture Reinhard Diestel and Imre Leader
- A proof of the Erd"os-Menger conjecture for countably connected graphs without large simplices
- Ubungen 7 zur Unendlichen Graphentheorie 1. Let G be a countable graph in which for every partial matching there
- Ubungen 3b zur Unendlichen Grapentheorie, WS 2011/12 1. Prove the compactness principle from Tychono's theorem.
- Ubungen 8 zur Graphentheorie 1. Die obere Kantendichte eines unendlichen Graphen G ist der limes su-
- Ubungen 5 zur Graphentheorie 1. An welcher Stelle geht der erste Beweis des Satzes von Menger schief,
- Ubungen 4 zur Unendlichen Grapentheorie, WS 2011/12 1. Show that a tree has a rank (as defined in the second paragraph after
- 5. Compactness proofs Theorem 8.1.3. (de Bruijn & Erdos, 1951)
- Ubungen 5 zur Unendlichen Graphentheorie 1. Show that the following assertions are equivalent for connected count-
- Englisch-deutscher Dieser Index enthalt die gebrauchlichsten englischen Worter all derjeni-
- Ubungen 3 zur Unendlichen Grapentheorie, WS 2011/12 1. Extend Theorem 2.4.4 to infinite graphs.
- Ubungen 6 zur Unendlichen Graphentheorie 1. Show that a locally finite connected vertex-transitive graph has exactly
- Ubungen 2 zur Unendlichen Grapentheorie, WS 2011/12 1. In the lectures, I said that the concatenation of any well-ordered chain
- 1. Ordnungsrelationen und Lemma von Zorn Ordnungsrelation, Teilordnung, teilweise Ordnung
- Strahl: unendlicher Weg mit Anfangsecke Ende von G: Aquivalenzklasse von Strahlen; zwei Strahlen sind
- Ubungen 1 zur Unendlichen Grapentheorie, WS 2011/12 1. Let G be a countable infinitely connected graph. Show that G has,
- 6. Recursive structures (= Ch. 8.6 of the book) Idea: simplify a tree for induction purposes, by pruning away
- The structure of 2-separations of infinite matroids Elad Aigner-Horev Reinhard Diestel Luke Postle
