Topological paths, cycles and spanning trees in infinite graphs
From MaRDI portal
Publication:1883294
DOI10.1016/J.EJC.2003.01.002zbMATH Open1050.05071OpenAlexW2057832909MaRDI QIDQ1883294FDOQ1883294
Authors: 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
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- The end structure of a graph: Recent results and open problems
- Graph-theoretical versus topological ends of graphs.
- A proof of the bounded graph conjecture
- Normal Spanning Trees, Aronszajn Trees and Excluded Minors
- On spanning trees and \(k\)-connectedness in infinite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of Graphs Into Closed and Endless Chains
- Infinite connected graphs with no end-preserving spanning trees
- An End-Faithful Spanning Tree Counterexample
Cited In (51)
- Graph topologies induced by edge lengths
- Labeled trees generating complete, compact, and discrete ultrametric spaces
- Dual trees must share their ends
- Graph-like continua, augmenting arcs, and Menger's theorem
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- The homology of a locally finite graph with ends
- Arboricity and tree-packing in locally finite graphs
- Axioms for infinite matroids
- Paths and animals in infinite graphs with tempered degree growth
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Extending cycles locally to Hamilton cycles
- On spanning tree packings of highly edge connected graphs
- Topological circles and Euler tours in locally finite graphs
- A sufficient condition for Hamiltonicity in locally finite graphs
- On infinite cycles. I, II
- The Lovász-Cherkassky theorem for locally finite graphs with ends
- Cycle spaces in topological spaces
- The bond and cycle spaces of an infinite graph
- Eulerian edge sets in locally finite graphs
- Locally finite graphs with ends: A topological approach. I: Basic theory
- Spanning trees of locally finite graphs
- End spaces and spanning trees
- Graph-theoretical versus topological ends of graphs.
- Duality of ends
- The Cycle Space of an Infinite Graph
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- MacLane's planarity criterion for locally finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-like spaces: an introduction
- Topological cycle matroids of infinite graphs
- Infinite matroids in graphs
- Topological infinite gammoids, and a new Menger-type theorem for infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- The fundamental group of a locally finite graph with ends
- Extremal infinite graph theory
- Infinite Hamilton cycles in squares of locally finite graphs
- Locally finite graphs with ends: A topological approach. II: Applications
- Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
- Bases and closures under infinite sums
- Contractible edges in \(k\)-connected infinite graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- Contractible edges in 2-connected locally finite graphs
- Connected but not path-connected subspaces of infinite graphs
- End spaces of graphs are normal
- Infinite paths in planar graphs I: Graphs with radial nets
- Contractible and removable edges in 3-connected infinite graphs
- Embedding a graph-like continuum in a surface
- Hamilton-laceable bi-powers of locally finite bipartite graphs
- Infinite paths in locally finite graphs and in their spanning trees
This page was built for publication: Topological paths, cycles and spanning trees in infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883294)