Cubic maximal nontraceable graphs

DOI10.1016/j.disc.2005.11.039zbMath1118.05048arXivmath/0407290OpenAlexW1996454535MaRDI QIDQ868358

Marietjie Frick, Joy E. Singleton

Publication date: 2 March 2007

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

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

zbMATH Keywords

Hamiltonian cycleHamiltonian pathmaximal nonhamiltonian

Mathematics Subject Classification ID

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

Related Items (2)

Degree sums of adjacent vertices for traceability of claw-free graphs ⋮ Towards obtaining a 3-decomposition from a perfect matching

Cites Work

• Unnamed Item
• Unnamed Item
• Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
• Smallest maximally nonhamiltonian graphs
• Smallest maximally nonhamiltonian graphs. II
• Vertices missed by longest paths or circuits
• On generating snarks
• Graphs maximal with respect to absence of hamiltonian paths
• Variations on the Hamiltonian Theme

This page was built for publication: Cubic maximal nontraceable graphs