Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs

DOI10.1016/j.disc.2005.11.063zbMath1117.05062OpenAlexW1985124593MaRDI QIDQ878613

Frank Bullock, Marietjie Frick, Joy E. Singleton

Publication date: 26 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.063

zbMATH Keywords

Hamiltonian pathlongest pathdetour

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Nontraceable detour graphs ⋮ Cubic maximal nontraceable graphs ⋮ Traceability on 2-connected line graphs ⋮ Hamiltonian path saturated graphs with small size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity in claw-free graphs
• Not every 2-tough graph is Hamiltonian
• On factors of 4-connected claw-free graphs
• Detour-saturated graphs
• Hamiltonian results inK1,3-free graphs
• Graphs maximal with respect to absence of hamiltonian paths

This page was built for publication: Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs