A sufficient condition for Hamiltonicity in locally finite graphs
From MaRDI portal
Publication:482128
DOI10.1016/J.EJC.2014.08.025zbMATH Open1304.05089arXiv1903.11660OpenAlexW2005190593MaRDI QIDQ482128FDOQ482128
Authors: Karl Heuer
Publication date: 19 December 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives a sufficient condition for Hamiltonicity in locally finite graphs.
Full work available at URL: https://arxiv.org/abs/1903.11660
Recommendations
Cites Work
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graph-theoretical versus topological ends of graphs.
- Topological paths, cycles and spanning trees in infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
- Hamilton Cycles in Planar Locally Finite Graphs
- On spanning tree packings of highly edge connected graphs
- On infinite cycles. I, II
- Extremal infinite graph theory
- Hamiltonian results inK1,3-free graphs
- Title not available (Why is that?)
- On the line graph of the square and the square of the line graph of a connected graph
- Eulerian edge sets in locally finite graphs
- Title not available (Why is that?)
Cited In (11)
- A localization method in Hamiltonian graph theory
- A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
- Extending cycles locally to Hamilton cycles
- Cycles through all finite vertex sets in infinite graphs
- Local Dirac's condition on the existence of 2-factor
- Hamilton circles in Cayley graphs
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- Some local-global phenomena in locally finite graphs
- Infinite Hamilton cycles in squares of locally finite graphs
- Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
- On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs
This page was built for publication: A sufficient condition for Hamiltonicity in locally finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482128)