Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture

DOI10.7151/dmgt.2346zbMath1493.05175OpenAlexW3045362491WikidataQ122897887 ScholiaQ122897887MaRDI QIDQ2158203

Marietjie Frick, Johan P. de Wet

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2346

zbMATH Keywords

locally Hamiltonianlocally traceableHamilton cycle problemlocally \(k\)-nested-HamiltonianOberly-Sumner conjecture

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs
• Hamiltonicity of locally Hamiltonian and locally traceable graphs
• On simple characterizations of k-trees
• The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs
• Subclasses of \(k\)-trees: characterization and recognition
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Locally connected graphs
• The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal--Erdös Condition
• Locally Hamiltonian and planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item