A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs

DOI10.1006/JCTB.1998.1867zbMath0930.05062OpenAlexW1990780374MaRDI QIDQ1306429

Bing Wei

Publication date: 9 February 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1867

zbMATH Keywords

Hamiltonianconnectivity

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A localization method in Hamiltonian graph theory

Cites Work

• A generalization of a result of Häggkvist and Nicoghossian
• A remark on Hamiltonian cycles

This page was built for publication: A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs