Scattering number and extremal non-Hamiltonian graphs

DOI10.1016/0012-365X(88)90069-6zbMath0655.05044OpenAlexW2038465558WikidataQ126819334 ScholiaQ126819334MaRDI QIDQ1109047

George R. T. Hendry

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90069-6

zbMATH Keywords

Hamiltoniantraceablescattering numberHamiltonian-connected

Mathematics Subject Classification ID

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

Related Items (8)

Relationships between scattering number and other vulnerability parameters ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ Maximum nonhamiltonian tough graphs ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Bounds for scattering number and rupture degree of graphs with genus ⋮ Hamiltonian-connectedness of triangulations with few separating triangles

Cites Work

• Arc coverings of graphs
• Hamilton connected graphs
• A catalogue of small maximal nonhamiltonian graphs
• A method in graph theory
• On a class of posets and the corresponding comparability graphs
• Nonhamiltonian connected graphs
• On Hamilton's ideals
• Tough graphs and Hamiltonian circuits.
• Variations on the Hamiltonian Theme
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scattering number and extremal non-Hamiltonian graphs