A short proof of a theorem on Hamiltonian graphs

DOI10.1002/(SICI)1097-0118(199605)22:1%3C83::AID-JGT11%3E3.0.CO;2-PMaRDI QIDQ4879170zbMATH OpenOpenAlexFDO

Authors Ahmed Ainouche

Publication date 10 July 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199605)22:1%3C83::aid-jgt11%3E3.0.co;2-p

zbMATH Keywords

claw-free graphdegree conditionhamiltonianhamiltonian graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
• Two theorems on Hamiltonian graphs
• scientific article; zbMATH DE number 4087695
• scientific article; zbMATH DE number 4123770
• scientific article; zbMATH DE number 2151842
• A short proof of a theorem on degree sets of graphs
• A cycle structure theorem for Hamiltonian graphs
• scientific article; zbMATH DE number 1750093
• Short proof that Kneser graphs are Hamiltonian for n 4k

Cited in

(8)

• On a conjecture of A. Ainouche and N. Christofides
• A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
• scientific article; zbMATH DE number 4177108 (Why is no real title available?)
• A short proof of a conjecture
• Hamiltonian graphs involving distances
• scientific article; zbMATH DE number 1112788 (Why is no real title available?)
• scientific article; zbMATH DE number 819130 (Why is no real title available?)
• A short proof of a theorem on degree sets of graphs

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

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