The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Reinhard Diestel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Reinhard Diestel
    Dominating functions and topological graph minors. [Citation Graph (0, 0)][DBLP]
    Graph Structure Theory, 1991, pp:461-476 [Conf]
  2. Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
    Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:17-36 [Journal]
  3. Reinhard Diestel, Rudolf Halin, Walter Vogler
    Some remarks on universal graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:283-293 [Journal]
  4. Reinhard Diestel, Daniela Kühn
    On Infinite Cycles I. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:1, pp:69-89 [Journal]
  5. Reinhard Diestel, Daniela Kühn
    On Infinite Cycles II. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:1, pp:91-116 [Journal]
  6. Reinhard Diestel, Christof Rempel
    Dense Minors In Graphs Of Large Girth. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:111-116 [Journal]
  7. Ron Aharoni, Reinhard Diestel
    Menger's Theorem for a Countable Source Set. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:145-156 [Journal]
  8. Reinhard Diestel, Imre Leader
    The Growth of Infinite Graphs: Boundedness and Finite Spreading. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:51-55 [Journal]
  9. Patrick Bellenbaum, Reinhard Diestel
    Two Short Proofs Concerning Tree-Decompositions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:6, pp:- [Journal]
  10. Reinhard Diestel
    The Cycle Space of an Infinite Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:59-79 [Journal]
  11. Reinhard Diestel
    Graph Minors 1: A Short Proof of the Path-width Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:27-30 [Journal]
  12. Reinhard Diestel, Daniela Kühn
    Graph minor hierarchies. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:167-182 [Journal]
  13. Reinhard Diestel, Daniela Kühn
    Topological paths, cycles and spanning trees in infinite graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:6, pp:835-862 [Journal]
  14. Reinhard Diestel
    The countable Erds-Menger conjecture with ends. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:145-161 [Journal]
  15. Reinhard Diestel
    The Erdös-Menger conjecture for source/sink sets with disjoint closures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:1, pp:107-114 [Journal]
  16. Reinhard Diestel
    Simplicial decompositions of graphs - Some uniqueness results. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:2, pp:133-145 [Journal]
  17. Reinhard Diestel
    Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:93-116 [Journal]
  18. Reinhard Diestel
    Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:1, pp:117-128 [Journal]
  19. Reinhard Diestel
    Simplicial tree-decompositions of infinite graphs, I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:2, pp:197-215 [Journal]
  20. Reinhard Diestel
    On spanning trees and k-connectedness in infinite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:263-277 [Journal]
  21. Reinhard Diestel
    The structure of TKa-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:222-238 [Journal]
  22. Reinhard Diestel
    The Depth-First Search Tree Structure of TKaleph0-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:260-262 [Journal]
  23. Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen
    Highly Connected Sets and the Excluded Grid Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:61-73 [Journal]
  24. Reinhard Diestel, Daniela Kühn
    Graph-theoretical versus topological ends of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:1, pp:197-206 [Journal]
  25. Reinhard Diestel, Robin Thomas
    Excluding a Countable Clique. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:76, n:1, pp:41-67 [Journal]
  26. Reinhard Diestel
    End spaces and spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:846-854 [Journal]
  27. Reinhard Diestel
    Relating Subsets of a Poset, and a Partition Theorem for WQOs. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:3, pp:275-279 [Journal]
  28. Reinhard Diestel, Oleg Pikhurko
    On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:1, pp:53-66 [Journal]
  29. Reinhard Diestel, Imre Leader
    Domination Games on Infinite Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:337-345 [Journal]
  30. Henning Bruhn, Reinhard Diestel, Maya Stein
    Menger's theorem for infinite graphs with ends. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:3, pp:199-211 [Journal]
  31. Henning Bruhn, Reinhard Diestel, Maya Stein
    Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:2, pp:150-161 [Journal]
  32. Reinhard Diestel
    On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:1, pp:21-33 [Journal]
  33. Reinhard Diestel
    Tree-decompositions, tree-representability and chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:2, pp:181-184 [Journal]
  34. Reinhard Diestel
    Simplicial decompositions of graphs: a survey of applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:121-144 [Journal]
  35. Reinhard Diestel
    Decomposing infinite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:69-89 [Journal]
  36. Reinhard Diestel
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:1- [Journal]
  37. Reinhard Diestel
    The end structure of a graph: recent results and open problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:100, n:1-3, pp:313-327 [Journal]

  38. Duality in Infinite Graphs. [Citation Graph (, )][DBLP]


  39. Locally finite graphs with ends: A topological approach, II. Applications. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002