Toughness and edge-toughness

DOI10.1016/S0012-365X(96)00051-9zbMath0874.05035OpenAlexW2011648561MaRDI QIDQ1356703

Gyula Y. Katona

Publication date: 9 November 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00051-9

zbMATH Keywords

toughnessedge-toughnesshamiltonicityhamiltonian

Mathematics Subject Classification ID

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

Related Items (7)

Local topological toughness and local factors ⋮ On edge-rupture degree of graphs ⋮ Edge Rupture Degree of Graphs ⋮ Toughness in graphs -- a survey ⋮ A large set of non-Hamiltonian graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Über die Maximalzahl kreuzungsfreier H-Wege
• Long cycles in graphs with prescribed toughness and minimum degree
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Toughness and edge-toughness