dblp.uni-trier.dewww.uni-trier.de

Reinhard Diestel Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
39EEHenning Bruhn, Reinhard Diestel: MacLane's theorem for arbitrary surfaces. J. Comb. Theory, Ser. B 99(2): 275-286 (2009)
2006
38EEStephan 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)
37EEHenning Bruhn, Reinhard Diestel: Duality in Infinite Graphs. Combinatorics, Probability & Computing 15(1-2): 75-90 (2006)
36EEReinhard Diestel: End spaces and spanning trees. J. Comb. Theory, Ser. B 96(6): 846-854 (2006)
2005
35EEReinhard Diestel: The Cycle Space of an Infinite Graph. Combinatorics, Probability & Computing 14(1-2): 59-79 (2005)
34EEReinhard Diestel, Daniela Kühn: Graph minor hierarchies. Discrete Applied Mathematics 145(2): 167-182 (2005)
33EEReinhard Diestel: The Erdös-Menger conjecture for source/sink sets with disjoint closures. J. Comb. Theory, Ser. B 93(1): 107-114 (2005)
32EEHenning 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)
31EEHenning Bruhn, Reinhard Diestel, Maya Stein: Menger's theorem for infinite graphs with ends. Journal of Graph Theory 50(3): 199-211 (2005)
2004
30EEReinhard Diestel, Daniela Kühn: On Infinite Cycles I. Combinatorica 24(1): 69-89 (2004)
29EEReinhard Diestel, Daniela Kühn: On Infinite Cycles II. Combinatorica 24(1): 91-116 (2004)
28EEReinhard Diestel, Christof Rempel: Dense Minors In Graphs Of Large Girth. Combinatorica 25(1): 111-116 (2004)
27EEReinhard Diestel, Daniela Kühn: Topological paths, cycles and spanning trees in infinite graphs. Eur. J. Comb. 25(6): 835-862 (2004)
2003
26EEReinhard Diestel: The countable Erds-Menger conjecture with ends. J. Comb. Theory, Ser. B 87(1): 145-161 (2003)
25EEReinhard Diestel, Daniela Kühn: Graph-theoretical versus topological ends of graphs. J. Comb. Theory, Ser. B 87(1): 197-206 (2003)
24EEReinhard 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): (2002)
2001
22EEReinhard Diestel: Relating Subsets of a Poset, and a Partition Theorem for WQOs. Order 18(3): 275-279 (2001)
1999
21EEReinhard 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)
20EEReinhard 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)
16EEReinhard 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
14EEReinhard Diestel: The end structure of a graph: recent results and open problems. Discrete Mathematics 100(1-3): 313-327 (1992)
13EEReinhard Diestel: The structure of TKa-free graphs. J. Comb. Theory, Ser. B 54(2): 222-238 (1992)
12EEReinhard 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
10EEReinhard Diestel: Preface. Discrete Mathematics 95(1-3): 1 (1991)
9EEReinhard Diestel: Decomposing infinite graphs. Discrete Mathematics 95(1-3): 69-89 (1991)
1990
8EEReinhard Diestel: Simplicial tree-decompositions of infinite graphs, I. J. Comb. Theory, Ser. B 48(2): 197-215 (1990)
7EEReinhard Diestel: Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. J. Comb. Theory, Ser. B 50(1): 117-128 (1990)
6EEReinhard Diestel: Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. J. Comb. Theory, Ser. B 50(1): 93-116 (1990)
1989
5EEReinhard Diestel: Simplicial decompositions of graphs: a survey of applications. Discrete Mathematics 75(1-3): 121-144 (1989)
1988
4EEReinhard Diestel: Tree-decompositions, tree-representability and chordal graphs. Discrete Mathematics 71(2): 181-184 (1988)
1987
3EEReinhard 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)
1EEReinhard Diestel: On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. Discrete Mathematics 55(1): 21-33 (1985)

Coauthor Index

1Ron Aharoni [18]
2Patrick Bellenbaum [23]
3Stephan Brandt [38]
4Hajo Broersma (H. J. Broersma) [38]
5Henning Bruhn [31] [32] [37] [39]
6Konstantin Yu. Gorbunov [21]
7Rudolf Halin [2]
8Tommy R. Jensen [21]
9Matthias Kriesell [38]
10Daniela Kühn [25] [27] [29] [30] [34]
11Imre Leader [15] [17]
12Oleg Pikhurko [24]
13Christof Rempel [28]
14Maya Jakobine Stein (Maya Stein) [31] [32]
15Robin Thomas [20]
16Carsten Thomassen [21]
17Walter Vogler [2]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)