 | 2012 |
|---|
| 50 |       | Reinhard Diestel,
Philipp Sprüssel:
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology.
Discrete Mathematics 312(1): 21-29 (2012) |
| 49 | | Reinhard Diestel,
Ken-ichi Kawarabayashi,
Paul Wollan:
The Erdős-Pósa property for clique minors in highly connected graphs.
J. Comb. Theory, Ser. B 102(2): 454-469 (2012) |
| 2011 |
|---|
| 48 | | Reinhard Diestel:
Locally finite graphs with ends: A topological approach, I. Basic theory.
Discrete Mathematics 311(15): 1423-1447 (2011) |
| 47 | | Henning Bruhn,
Reinhard Diestel:
Infinite matroids in graphs.
Discrete Mathematics 311(15): 1461-1471 (2011) |
| 46 | | Elad Aigner-Horev,
Reinhard Diestel,
Luke Postle:
Decomposing infinite matroids into their 3-connected minors.
Electronic Notes in Discrete Mathematics 38: 11-16 (2011) |
| 45 | | Anthony Bonato,
Henning Bruhn,
Reinhard Diestel,
Philipp Sprüssel:
Twins of rayless graphs.
J. Comb. Theory, Ser. B 101(1): 60-65 (2011) |
| 2010 |
|---|
| 44 | | Henning Bruhn,
Reinhard Diestel,
Agelos Georgakopoulos,
Philipp Sprüssel:
Every rayless graph has an unfriendly partition.
Combinatorica 30(5): 521-532 (2010) |
| 43 | | Reinhard Diestel,
Philipp Sprüssel:
The homology of a locally finite graph with ends.
Combinatorica 30(6): 681-714 (2010) |
| 42 | | Reinhard Diestel:
Locally finite graphs with ends: A topological approach, II. Applications.
Discrete Mathematics 310(20): 2750-2765 (2010) |
| 2009 |
|---|
| 41 | | Henning Bruhn,
Reinhard Diestel,
Agelos Georgakopoulos,
Philipp Sprüssel:
Every rayless graph has an unfriendly partition.
Electronic Notes in Discrete Mathematics 34: 279-281 (2009) |
| 40 | | Henning Bruhn,
Reinhard Diestel:
MacLane's theorem for arbitrary surfaces.
J. Comb. Theory, Ser. B 99(2): 275-286 (2009) |
| 2006 |
|---|
| 39 |  | Reinhard Diestel:
Graphentheorie (3. Aufl.).
Springer 2006: I-XVI, 1-344 |
| 38 | | Stephan Brandt,
Hajo Broersma,
Reinhard Diestel,
Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs.
Combinatorica 26(1): 17-36 (2006) |
| 37 | | Henning Bruhn,
Reinhard Diestel:
Duality in Infinite Graphs.
Combinatorics, Probability & Computing 15(1-2): 75-90 (2006) |
| 36 | | Reinhard Diestel:
End spaces and spanning trees.
J. Comb. Theory, Ser. B 96(6): 846-854 (2006) |
| 2005 |
|---|
| 35 | | Reinhard Diestel:
The Cycle Space of an Infinite Graph.
Combinatorics, Probability & Computing 14(1-2): 59-79 (2005) |
| 34 | | Reinhard Diestel,
Daniela Kühn:
Graph minor hierarchies.
Discrete Applied Mathematics 145(2): 167-182 (2005) |
| 33 | | Reinhard Diestel:
The Erdös-Menger conjecture for source/sink sets with disjoint closures.
J. Comb. Theory, Ser. B 93(1): 107-114 (2005) |
| 32 | | Henning Bruhn,
Reinhard Diestel,
Maya Stein:
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.
Journal of Graph Theory 50(2): 150-161 (2005) |
| 31 | | Henning Bruhn,
Reinhard Diestel,
Maya Stein:
Menger's theorem for infinite graphs with ends.
Journal of Graph Theory 50(3): 199-211 (2005) |
| 2004 |
|---|
| 30 | | Reinhard Diestel,
Daniela Kühn:
On Infinite Cycles I.
Combinatorica 24(1): 69-89 (2004) |
| 29 | | Reinhard Diestel,
Daniela Kühn:
On Infinite Cycles II.
Combinatorica 24(1): 91-116 (2004) |
| 28 | | Reinhard Diestel,
Christof Rempel:
Dense Minors In Graphs Of Large Girth.
Combinatorica 25(1): 111-116 (2004) |
| 27 | | Reinhard Diestel,
Daniela Kühn:
Topological paths, cycles and spanning trees in infinite graphs.
Eur. J. Comb. 25(6): 835-862 (2004) |
| 2003 |
|---|
| 26 | | Reinhard Diestel:
The countable Erds-Menger conjecture with ends.
J. Comb. Theory, Ser. B 87(1): 145-161 (2003) |
| 25 | | Reinhard Diestel,
Daniela Kühn:
Graph-theoretical versus topological ends of graphs.
J. Comb. Theory, Ser. B 87(1): 197-206 (2003) |
| 24 | | Reinhard Diestel,
Oleg Pikhurko:
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets.
Order 20(1): 53-66 (2003) |
| 2002 |
|---|
| 23 | | Patrick Bellenbaum,
Reinhard Diestel:
Two Short Proofs Concerning Tree-Decompositions.
Combinatorics, Probability & Computing 11(6): 541-547 (2002) |
| 2001 |
|---|
| 22 | | Reinhard Diestel:
Relating Subsets of a Poset, and a Partition Theorem for WQOs.
Order 18(3): 275-279 (2001) |
| 1999 |
|---|
| 21 | | Reinhard Diestel,
Tommy R. Jensen,
Konstantin Yu. Gorbunov,
Carsten Thomassen:
Highly Connected Sets and the Excluded Grid Theorem.
J. Comb. Theory, Ser. B 75(1): 61-73 (1999) |
| 20 | | Reinhard Diestel,
Robin Thomas:
Excluding a Countable Clique.
J. Comb. Theory, Ser. B 76(1): 41-67 (1999) |
| 1995 |
|---|
| 19 | | Reinhard Diestel:
Graph Minors 1: A Short Proof of the Path-width Theorem.
Combinatorics, Probability & Computing 4: 27-30 (1995) |
| 1994 |
|---|
| 18 | | Ron Aharoni,
Reinhard Diestel:
Menger's Theorem for a Countable Source Set.
Combinatorics, Probability & Computing 3: 145-156 (1994) |
| 17 | | Reinhard Diestel,
Imre Leader:
The Growth of Infinite Graphs: Boundedness and Finite Spreading.
Combinatorics, Probability & Computing 3: 51-55 (1994) |
| 16 | | Reinhard Diestel:
The Depth-First Search Tree Structure of TKaleph0-Free Graphs.
J. Comb. Theory, Ser. B 61(2): 260-262 (1994) |
| 15 | | Reinhard Diestel,
Imre Leader:
Domination Games on Infinite Graphs.
Theor. Comput. Sci. 132(2): 337-345 (1994) |
| 1992 |
|---|
| 14 | | Reinhard Diestel:
The end structure of a graph: recent results and open problems.
Discrete Mathematics 100(1-3): 313-327 (1992) |
| 13 | | Reinhard Diestel:
The structure of TKa-free graphs.
J. Comb. Theory, Ser. B 54(2): 222-238 (1992) |
| 12 | | Reinhard Diestel:
On spanning trees and k-connectedness in infinite graphs.
J. Comb. Theory, Ser. B 56(2): 263-277 (1992) |
| 1991 |
|---|
| 11 | | Reinhard Diestel:
Dominating functions and topological graph minors.
Graph Structure Theory 1991: 461-476 |
| 10 | | Reinhard Diestel:
Preface.
Discrete Mathematics 95(1-3): 1 (1991) |
| 9 | | Reinhard Diestel:
Decomposing infinite graphs.
Discrete Mathematics 95(1-3): 69-89 (1991) |
| 1990 |
|---|
| 8 | | Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs, I.
J. Comb. Theory, Ser. B 48(2): 197-215 (1990) |
| 7 | | Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.
J. Comb. Theory, Ser. B 50(1): 117-128 (1990) |
| 6 | | Reinhard Diestel:
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.
J. Comb. Theory, Ser. B 50(1): 93-116 (1990) |
| 1989 |
|---|
| 5 | | Reinhard Diestel:
Simplicial decompositions of graphs: a survey of applications.
Discrete Mathematics 75(1-3): 121-144 (1989) |
| 1988 |
|---|
| 4 | | Reinhard Diestel:
Tree-decompositions, tree-representability and chordal graphs.
Discrete Mathematics 71(2): 181-184 (1988) |
| 1987 |
|---|
| 3 | | Reinhard Diestel:
Simplicial decompositions of graphs - Some uniqueness results.
J. Comb. Theory, Ser. B 42(2): 133-145 (1987) |
| 1985 |
|---|
| 2 | | Reinhard Diestel,
Rudolf Halin,
Walter Vogler:
Some remarks on universal graphs.
Combinatorica 5(4): 283-293 (1985) |
| 1 | | Reinhard Diestel:
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs.
Discrete Mathematics 55(1): 21-33 (1985) |
Data released under the ODC-BY 1.0 license — See also our legal information page