On a construction of Thomassen

DOI10.1007/BF01788108zbMath0612.05041OpenAlexW2038624721MaRDI QIDQ1087884

Jozef Širáň, Peter Horák

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788108

zbMATH Keywords

maximally nonhamiltonian graphsMNH graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items

Subgraphs intersecting any Hamiltonian cycle ⋮ Optimal 1-Hamiltonian graphs ⋮ On the size of maximally non-hamiltonian digraphs ⋮ Maximally non-hamiltonian graphs of girth 7

Cites Work

• Hypohamiltonian and hypotraceable graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Variations on the Hamiltonian Theme