Cycles through all finite vertex sets in infinite graphs

DOI10.1016/j.ejc.2017.06.006zbMath1369.05123OpenAlexW2736521870WikidataQ56926453 ScholiaQ56926453MaRDI QIDQ2400982

Carsten Thomassen, André Kündgen, Bin Long Li

Publication date: 31 August 2017

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.06.006

zbMATH Keywords

Barnette's conjectureHamiltonian curve

Mathematics Subject Classification ID

Paths and cycles (05C38) Infinite graphs (05C63)

Related Items

Hamilton-laceable bi-powers of locally finite bipartite graphs ⋮ Some local-global phenomena in locally finite graphs ⋮ A localization method in Hamiltonian graph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A sufficient condition for Hamiltonicity in locally finite graphs
• Locally finite graphs with ends: A topological approach. II: Applications
• Some localization theorems on Hamiltonian circuits
• Edge-decompositions of highly connected graphs into paths
• A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
• Ramsey numbers of graphs with long tails
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Hamiltonicity in locally finite graphs: two extensions and a counterexample
• Locally finite graphs with ends: A topological approach. I: Basic theory
• Hamilton circles in infinite planar graphs
• Infinite Hamilton cycles in squares of locally finite graphs
• The square of every two-connected graph is Hamiltonian
• A Theorem on Planar Graphs
• Hamiltonian results inK1,3-free graphs
• Hamilton Cycles in Planar Locally Finite Graphs
• Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
• A characterization of Hamiltonian prisms
• Reflections on graph theory
• On Representatives of Subsets
• On Eulerian and Hamiltonian Graphs and Line Graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity