scientific article; zbMATH DE number 861394

MaRDI QIDQ4871126zbMATH OpenFDO

Authors E. Schmeichel, D. Bauer, Henk Jan Veldman

Publication date 19 May 1996

zbMATH Keywords

2-factorsChvátal's conjecturecircumferencecomplexitycycle structurehamiltonian graphsurveytoughness

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 434902
• Tough Ramsey graphs without short cycles

Cited in

(9)

• Toughness and edge-toughness
• Long cycles in graphs with prescribed toughness and minimum degree
• Toughness, hamiltonicity and split graphs
• A note on dominating cycles in 2-connected graphs
• Chordality and 2-factors in tough graphs
• Toughness in graphs -- a survey
• On the Toughness of Cycle Permutation Graphs
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Spectral conditions of pancyclicity for t-tough 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 Q4871126)