A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs

DOI10.1016/J.EJC.2016.01.003zbMath1333.05175arXiv1903.11663OpenAlexW2312410840MaRDI QIDQ268267

Karl Heuer

Publication date: 14 April 2016

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

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

zbMATH Keywords

Diestel conjectureHamiltonicity of a finite graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Extending cycles locally to Hamilton cycles ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Some local-global phenomena in locally finite graphs ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls ⋮ Hamilton circles in Cayley graphs ⋮ A localization method in Hamiltonian graph theory

Cites Work

• Extending cycles locally to Hamilton cycles
• On spanning tree packings of highly edge connected graphs
• A sufficient condition for Hamiltonicity in locally finite graphs
• On infinite cycles. I, II
• Some localization theorems on Hamiltonian circuits
• 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
• Note on Hamilton Circuits
• Hamilton Cycles in Planar Locally Finite Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs