Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls

DOI10.1002/jgt.22902zbMath1522.05265arXiv2006.09160OpenAlexW3035234999MaRDI QIDQ6094051

Karl Heuer, Unnamed Author

Publication date: 9 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonicityforbidden induced subgraphslocally finite graphsFreudenthal compactificationends of infinite graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Infinite graphs (05C63)

Cites Work

• 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
• Contractible edges in 2-connected locally finite graphs
• On infinite cycles. I, II
• Infinite paths that contain only shortest paths
• Hamiltonicity in claw-free graphs
• Graph-theoretical versus topological ends of graphs.
• Hamiltonicity in locally finite graphs: two extensions and a counterexample
• Hamilton cycles in infinite cubic graphs
• Topological paths, cycles and spanning trees in infinite graphs
• Hamiltonicity in claw-free graphs through induced bulls
• Hamilton-laceable bi-powers of locally finite bipartite graphs
• On end degrees and infinite cycles in locally finite graphs
• Infinite Hamilton cycles in squares of locally finite graphs
• Graph Theory
• Hamilton Cycles in Planar Locally Finite Graphs

This page was built for publication: Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls