The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs

DOI10.1016/j.dam.2019.02.046zbMath1464.05221OpenAlexW2922957428MaRDI QIDQ2026347

Johan P. de Wet, Marietjie Frick

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.046

zbMATH Keywords

locally HamiltonianHamilton cycle problemlocally traceable graph

Mathematics Subject Classification ID

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

Related Items (1)

Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture

Cites Work

• Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Hamiltonian properties of triangular grid graphs
• The complexity of recognizing tough cubic graphs
• Hamiltonicity of locally Hamiltonian and locally traceable graphs
• Hamilton cycles in sparse locally connected graphs
• Pancyclicity and NP-completeness in planar graphs
• Local connectivity of a random graph
• A strengthening of Kikustapos;s theorem
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Locally connected graphs
• Locally Hamiltonian and planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs