Large Isaacs' graphs are maximally non-Hamilton-connected

DOI10.1016/0012-365X(90)90049-NzbMath0714.05035OpenAlexW2016058531MaRDI QIDQ750459

Zdzisław Skupień, Rafał Kalinowski

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90049-n

zbMATH Keywords

Isaacs' graphmaximally non-Hamiltonian-connected

Mathematics Subject Classification ID

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

Related Items (3)

Saturation numbers for families of graph subdivisions ⋮ Hamiltonian path saturated graphs with small size ⋮ Classification and characterizations of snarks

Cites Work

• Smallest maximally nonhamiltonian graphs
• New families of hypohamiltonian graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large Isaacs' graphs are maximally non-Hamilton-connected