An improvement of Bondy's theorem on Hamilton graph condition

zbMATH Open0986.05068MaRDI QIDQ2767416

Zhenhong Liu, Feng Tian, Dongqi He

Publication date: 29 January 2002

Published in: Advances in Mathematics (Beijing) (Search for Journal in Brave)

zbMATH Keywords

connectivitycircumferenceHamilton cycletough graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Edge-connectivity and edge-disjoint spanning trees

Recommendations

• A new sufficient condition for hamiltonicity of graphs 👍 👎
• A new sufficient condition for Hamiltonian graphs 👍 👎
• A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs 👍 👎
• An improvement of fraisse's sufficient condition for hamiltonian graphs 👍 👎
• Improved bounds for hypohamiltonian graphs 👍 👎
• An improvement of spectral conditions for Hamilton-connected graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An improvement of Bondy's theorem on Hamilton graph condition

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