The following pages link to Reinhard Diestel (Q215083):
Displayed 50 items.
- Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
- A simple existence criterion for normal spanning trees (Q286119) (← links)
- Axioms for infinite matroids (Q390757) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
- Dual trees must share their ends (Q505909) (← links)
- On the homology of locally compact spaces with ends (Q554423) (← links)
- On infinite cycles. I, II (Q558227) (← links)
- Dense minors in graphs of large girth (Q558318) (← links)
- Item:Q215083 (redirect page) (← links)
- Twins of rayless graphs (Q618035) (← links)
- The fundamental group of a locally finite graph with ends (Q624334) (← links)
- The homology of a locally finite graph with ends (Q653838) (← links)
- Locally finite graphs with ends: a topological approach. III. Fundamental group and homology (Q658014) (← links)
- On vertex transitive graphs of infinite degree (Q689779) (← links)
- The Erdős-Menger conjecture for source/sink sets with disjoint closures (Q707026) (← links)
- Locally finite graphs with ends: A topological approach. II: Applications (Q709326) (← links)
- Connected tree-width (Q722321) (← links)
- Orthogonality and minimality in the homology of locally finite graphs (Q743646) (← links)
- Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions (Q750465) (← links)
- End spaces and spanning trees (Q859612) (← links)
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (Q895993) (← links)
- The structure of 2-separations of infinite matroids (Q895994) (← links)
- MacLane's theorem for arbitrary surfaces (Q1003829) (← links)
- On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752) (← links)
- On universal graphs with forbidden topological subgraphs (Q1068096) (← links)
- Simplicial decompositions of graphs - some uniqueness results (Q1068851) (← links)
- Tree-decompositions, tree-representability and chordal graphs (Q1104938) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← links)
- A compactness theorem for complete separators (Q1173791) (← links)
- Decomposing infinite graphs (Q1191914) (← links)
- The structure of \(TK_ a\)-free graphs (Q1193564) (← links)
- The end structure of a graph: Recent results and open problems (Q1198656) (← links)
- On spanning trees and \(k\)-connectedness in infinite graphs (Q1204461) (← links)
- A proof of the bounded graph conjecture (Q1207424) (← links)
- Excluding a countable clique (Q1305523) (← links)
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs (Q1333343) (← links)
- Domination games on infinite graphs (Q1334671) (← links)
- The countable Erdős-Menger conjecture with ends (Q1403915) (← links)
- Graph-theoretical versus topological ends of graphs. (Q1403917) (← links)
- On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets (Q1404380) (← links)
- Relating subsets of a poset, and a partition theorem for WQOs (Q1611297) (← links)
- Rudolf Halin: 1934--2014 (Q1688258) (← links)
- Ends and tangles (Q1688261) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- A short proof of Halin's grid theorem (Q1766187) (← links)
- Topological paths, cycles and spanning trees in infinite graphs (Q1883294) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Profinite separation systems (Q2183105) (← links)