Hamiltonian cycles in 1-tough graphs

DOI10.1007/BF01858471zbMath0866.05037MaRDI QIDQ2563428

Bing Wei

Publication date: 20 July 1997

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

zbMATH Keywords

Hamiltonian cycle1-tough graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Long cycles in graphs with large degree sums
• Hamiltonism, degree sum and neighborhood intersections
• A generalization of a result of Bauer and Schmeichel
• On Maximal Circuits in Finite Graphs
• The binding number of a graph and its Anderson number

This page was built for publication: Hamiltonian cycles in 1-tough graphs