Extending cycles locally to Hamilton cycles

zbMath1335.05122MaRDI QIDQ278887

Florian Lehner, Julian Pott, Matthias Hamann

Publication date: 3 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p49

zbMATH Keywords

graph theoryinfinite graphsHamilton cycles

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)

Related Items (7)

A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs ⋮ 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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs
• On spanning tree packings of highly edge connected graphs
• A sufficient condition for Hamiltonicity in locally finite graphs
• On infinite cycles. I, II
• Eulerian edge sets in locally finite graphs
• Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
• A note on Menger's theorem for infinite locally finite graphs
• Graph-theoretical versus topological ends of graphs.
• Über die Enden topologischer Räume und Gruppen
• Topological paths, cycles and spanning trees in infinite graphs
• Extremal infinite graph theory
• On end degrees and infinite cycles in locally finite graphs
• Hamilton circles in infinite planar 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
• Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
• On the line graph of the square and the square of the line graph of a connected graph

This page was built for publication: Extending cycles locally to Hamilton cycles