A sufficient condition for Hamiltonicity in locally finite graphs

DOI10.1016/j.ejc.2014.08.025zbMath1304.05089arXiv1903.11660MaRDI QIDQ482128

Karl Heuer

Publication date: 19 December 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.11660

zbMATH Keywords

Freudenthal compactification of a graph; topological circles

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Local Dirac's condition on the existence of 2-factor, Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls, A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs, Extending cycles locally to Hamilton cycles, Hamiltonicity in locally finite graphs: two extensions and a counterexample, Hamilton circles in Cayley graphs, A localization method in Hamiltonian graph theory, Cycles through all finite vertex sets in infinite graphs, Some local-global phenomena in locally finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On spanning tree packings of highly edge connected graphs
• On infinite cycles. I, II
• Eulerian edge sets in locally finite graphs
• Graph-theoretical versus topological ends of graphs.
• Topological paths, cycles and spanning trees in infinite graphs
• Extremal infinite graph theory
• 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
• Hamiltonian results inK1,3-free graphs
• Hamilton Cycles in Planar Locally Finite Graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• On the line graph of the square and the square of the line graph of a connected graph