|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 5 keywords
|
|
|
|
|
Results
Found 50 publication records. Showing 50 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Philipp Sprüssel |
Locally finite graphs with ends: A topological approach, III. Fundamental group and homology. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel |
Twins of rayless graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Aigner-Horev, Reinhard Diestel, Luke Postle |
Decomposing infinite matroids into their 3-connected minors. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
Infinite matroids in graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Locally finite graphs with ends: A topological approach, I. Basic theory. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Locally finite graphs with ends: A topological approach, II. Applications. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel |
Every rayless graph has an unfriendly partition. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Philipp Sprüssel |
The homology of a locally finite graph with ends. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
MacLane's theorem for arbitrary surfaces. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel |
Every rayless graph has an unfriendly partition. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
End spaces and spanning trees. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
Duality in Infinite Graphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell |
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C45, 05C70, 05C38 |
| 1 | Reinhard Diestel |
Graphentheorie (3. Aufl.). |
|
2006 |
RDF |
|
| 1 | Reinhard Diestel |
The Erdös-Menger conjecture for source/sink sets with disjoint closures. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
The Cycle Space of an Infinite Graph. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Maya Stein |
Menger's theorem for infinite graphs with ends. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Maya Stein |
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Daniela Kühn |
Graph minor hierarchies. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Daniela Kühn |
Topological paths, cycles and spanning trees in infinite graphs. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Daniela Kühn |
On Infinite Cycles II. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 5C10, 5C38, 57M15 |
| 1 | Reinhard Diestel, Daniela Kühn |
On Infinite Cycles I. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 5C10, 5C38, 5C45, 57M15 |
| 1 | Reinhard Diestel, Christof Rempel |
Dense Minors In Graphs Of Large Girth. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05C83 |
| 1 | Reinhard Diestel |
The countable Erds-Menger conjecture with ends. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Daniela Kühn |
Graph-theoretical versus topological ends of graphs. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Oleg Pikhurko |
On the Cofinality of Infinite Partially Ordered Sets: Factoring a Poset into Lean Essential Subsets. |
Order |
2003 |
DBLP DOI BibTeX RDF |
infinite posets, cofinality, poset decomposition |
| 1 | Patrick Bellenbaum, Reinhard Diestel |
Two Short Proofs Concerning Tree-Decompositions. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Relating Subsets of a Poset, and a Partition Theorem for WQOs. |
Order |
2001 |
DBLP DOI BibTeX RDF |
WQO, partition, graph minors, well-quasi-order |
| 1 | Reinhard Diestel, Robin Thomas |
Excluding a Countable Clique. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen |
Highly Connected Sets and the Excluded Grid Theorem. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Graph Minors 1: A Short Proof of the Path-width Theorem. |
Combinatorics, Probability & Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
The Depth-First Search Tree Structure of TKaleph0-Free Graphs. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Imre Leader |
Domination Games on Infinite Graphs. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Aharoni, Reinhard Diestel |
Menger's Theorem for a Countable Source Set. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Imre Leader |
The Growth of Infinite Graphs: Boundedness and Finite Spreading. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
On spanning trees and k-connectedness in infinite graphs. |
J. Comb. Theory, Ser. B |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
The structure of TKa-free graphs. |
J. Comb. Theory, Ser. B |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
The end structure of a graph: recent results and open problems. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Decomposing infinite graphs. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Preface. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Dominating functions and topological graph minors. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Reinhard Diestel |
Simplicial tree-decompositions of infinite graphs, I. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Simplicial decompositions of graphs: a survey of applications. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Tree-decompositions, tree-representability and chordal graphs. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
Simplicial decompositions of graphs - Some uniqueness results. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel |
On the problem of finding small subdivision and homomorphism bases for classes of countable graphs. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Rudolf Halin, Walter Vogler |
Some remarks on universal graphs. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #50 of 50 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")