scientific article; zbMATH DE number 68618

MaRDI QIDQ4014493zbMATH OpenFDO

Authors Zdzisław Skupień

Publication date 5 October 1992

zbMATH Keywords

non-Hamiltonian graphstough graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cited in

(9)

• Maximum nonhamiltonian tough graphs
• All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions
• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• Non-hamiltonian 5 4-tough maximal planar graphs
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Toughness and nonhamiltonicity of polyhedral graphs
• Tough graphs and Hamiltonian circuits. (Reprint)
• Tough graphs and Hamiltonian circuits.
• On hamiltonicity of 1-tough triangle-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014493)