A catalogue of small maximal nonhamiltonian graphs

DOI10.1016/0012-365X(82)90145-5zbMath0481.05038MaRDI QIDQ1161757

Janusz Jamrozik, Rafał Kalinowski, Zdzisław Skupień

Publication date: 1982

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

zbMATH Keywords

hamiltonian graphs

Mathematics Subject Classification ID

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

Related Items (9)

The Hamiltonian problem and \(t\)-path traceable graphs ⋮ Computing the Scattering Number of Graphs ⋮ Subgraphs intersecting any Hamiltonian cycle ⋮ Scattering number and extremal non-Hamiltonian graphs ⋮ Relationships between scattering number and other vulnerability parameters ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Maximum nonhamiltonian tough graphs ⋮ Bounds for scattering number and rupture degree of graphs with genus ⋮ All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions

Cites Work

• Unnamed Item
• A method in graph theory
• On a class of posets and the corresponding comparability graphs
• Tough graphs and Hamiltonian circuits.
• Degrees in Homogeneously Traceable Graphs
• Cycles and Connectivity in Graphs
• A catalog of minimal blocks

This page was built for publication: A catalogue of small maximal nonhamiltonian graphs