A short proof of a theorem on Hamiltonian graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<83::AID-JGT11>3.0.CO;2-P" /><83::AID-JGT11>3.0.CO;2-P 10.1002/(SICI)1097-0118(199605)22:1<83::AID-JGT11>3.0.CO;2-PzbMath0851.05075OpenAlexW1989216097MaRDI QIDQ4879170

Ahmed Ainouche

Publication date: 10 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<83::aid-jgt11>3.0.co;2-p

zbMATH Keywords

hamiltonian graphclaw-free graphdegree conditionhamiltonian

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

This page was built for publication: A short proof of a theorem on Hamiltonian graphs