A generalization of a result of Bauer and Schmeichel

DOI10.1007/BF02988325zbMath0791.05071MaRDI QIDQ1313355

Bing Wei

Publication date: 26 January 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycletoughness

Mathematics Subject Classification ID

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

Related Items (3)

Hamilton-connectivity of interconnection networks modeled by a product of graphs ⋮ Toughness in graphs -- a survey ⋮ Hamiltonian cycles in 1-tough graphs

Cites Work

• Long cycles in graphs with large degree sums
• A generalization of a result of Häggkvist and Nicoghossian
• A remark on Hamiltonian cycles
• Tough graphs and Hamiltonian circuits.

This page was built for publication: A generalization of a result of Bauer and Schmeichel