Topological paths, cycles and spanning trees in infinite graphs
From MaRDI portal
Publication:1883294
DOI10.1016/j.ejc.2003.01.002zbMath1050.05071OpenAlexW2057832909MaRDI QIDQ1883294
Reinhard Diestel, Daniela Kühn
Publication date: 4 October 2004
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2003.01.002
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (40)
A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs ⋮ Extending cycles locally to Hamilton cycles ⋮ Hamilton-laceable bi-powers of locally finite bipartite graphs ⋮ On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs ⋮ Graph-like continua, augmenting arcs, and Menger's theorem ⋮ End spaces and spanning trees ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Axioms for infinite matroids ⋮ Labeled trees generating complete, compact, and discrete ultrametric spaces ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ On spanning tree packings of highly edge connected graphs ⋮ The Lovász-Cherkassky theorem for locally finite graphs with ends ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls ⋮ The fundamental group of a locally finite graph with ends ⋮ Graph-theoretical versus topological ends of graphs. ⋮ The homology of a locally finite graph with ends ⋮ Eulerian edge sets in locally finite graphs ⋮ End spaces of graphs are normal ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ On end degrees and infinite cycles in locally finite graphs ⋮ Contractible edges in 2-connected locally finite graphs ⋮ Duality of Ends ⋮ Dual trees must share their ends ⋮ Connected but not path-connected subspaces of infinite graphs ⋮ Embedding a graph-like continuum in a surface ⋮ Bases and closures under infinite sums ⋮ MacLane's planarity criterion for locally finite graphs ⋮ Arboricity and tree-packing in locally finite graphs ⋮ The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Graph-like spaces: an introduction ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Infinite matroids in graphs ⋮ Extremal infinite graph theory ⋮ Graph topologies induced by edge lengths ⋮ Cycle spaces in topological spaces ⋮ The bond and cycle spaces of an infinite graph ⋮ Infinite Hamilton cycles in squares of locally finite graphs ⋮ A greedy algorithm for finding maximum spanning trees in infinite graphs ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite connected graphs with no end-preserving spanning trees
- The end structure of a graph: Recent results and open problems
- On spanning trees and \(k\)-connectedness in infinite graphs
- A proof of the bounded graph conjecture
- Graph-theoretical versus topological ends of graphs.
- Normal Spanning Trees, Aronszajn Trees and Excluded Minors
- Decomposition of Graphs Into Closed and Endless Chains
- An End-Faithful Spanning Tree Counterexample
This page was built for publication: Topological paths, cycles and spanning trees in infinite graphs
