scientific article; zbMATH DE number 4177107

MaRDI QIDQ3201097zbMATH OpenFDO

Authors Zdzisław Skupień

Publication date 1989

zbMATH Keywords

1-tough graphHamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A sufficient condition for Hamiltonian cycles in tough graphs
• scientific article; zbMATH DE number 68362
• A generalization of a result of Bauer and Schmeichel
• scientific article; zbMATH DE number 861334
• An Ore-type condition for Hamiltonicity in tough graphs

Cited in

(11)

• All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions
• A sufficient condition for Hamiltonian cycles in tough graphs
• Hamiltonian degree conditions for tough graphs
• An Ore-type condition for Hamiltonicity in tough graphs
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• scientific article; zbMATH DE number 4137803 (Why is no real title available?)
• Updating the hamiltonian problem—A survey
• scientific article; zbMATH DE number 68362 (Why is no real title available?)
• On Path-Tough Graphs
• An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
• Hamiltonian cycles and tight cutsets

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 Q3201097)