Infinite Hamilton cycles in squares of locally finite graphs

DOI10.1016/j.aim.2008.09.014zbMath1205.05133OpenAlexW1970201352MaRDI QIDQ2519763

Angelos Georgakopoulos

Publication date: 27 January 2009

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2008.09.014

zbMATH Keywords

squareslocally finite graphsinfinite Hamilton cycles

Mathematics Subject Classification ID

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

Related Items (28)

A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs ⋮ Extending cycles locally to Hamilton cycles ⋮ Hamilton-laceable bi-powers of locally finite bipartite graphs ⋮ On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs ⋮ Topological cycle matroids of infinite 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 ⋮ Unavoidable topological minors of infinite graphs ⋮ On spanning tree packings of highly edge connected graphs ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls ⋮ The fundamental group of a locally finite graph with ends ⋮ Dead ends on wreath products and lamplighter groups ⋮ Invariant spanning double rays in amenable groups ⋮ The homology of a locally finite graph with ends ⋮ Eulerian edge sets in locally finite graphs ⋮ Cycle decompositions: from graphs to continua ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ The Planar Cubic Cayley Graphs ⋮ Infinite end-devouring sets of rays with prescribed start vertices ⋮ Hamilton circles in Cayley graphs ⋮ A localization method in Hamiltonian graph theory ⋮ Bases and closures under infinite sums ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Extremal infinite graph theory ⋮ Graph topologies induced by edge lengths ⋮ A short proof of Fleischner's theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On infinite cycles. I, II
• The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
• Connected but not path-connected subspaces of infinite graphs
• A short proof of Fleischner's theorem
• A new proof of the theorem by Fleischner
• A note on Menger's theorem for infinite locally finite graphs
• 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
• MacLane's planarity criterion for locally finite graphs
• Hamilton circles in infinite planar graphs
• The square of every two-connected graph is Hamiltonian
• A Theorem on Planar Graphs
• Hamilton Cycles in Planar Locally Finite Graphs
• Hamiltonian Paths in Squares of Infinite Locally Finite Blocks
• Abzählbar-unendliche Graphen mit HAMILTONscher dritter Potenz
• The Cycle Space of an Infinite Graph
• On the Cube of a Graph
• Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs

This page was built for publication: Infinite Hamilton cycles in squares of locally finite graphs