An improvement of fraisse's sufficient condition for hamiltonian graphs

DOI10.1002/jgt.3190160602zbMath0770.05070OpenAlexW1990945383MaRDI QIDQ4016020

Ahmed Ainouche

Publication date: 17 December 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160602

zbMATH Keywords

hamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (17)

A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs ⋮ Hamiltonicity of 2-connected claw-center independent graphs ⋮ Longest cycles in 3-connected graphs ⋮ On degree sum conditions for 2-factors with a prescribed number of cycles ⋮ Degree sum conditions for Hamiltonicity on \(k\)-partite graphs ⋮ Longest cycles in 4-connected graphs ⋮ Quasi-claw-free graphs ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles ⋮ A new neighborhood union condition for Hamiltonian graphs ⋮ Hamiltonicity of 4-connected graphs ⋮ Hamilton connectedness and the partially square graphs ⋮ Spanning trees with a bounded number of leaves ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Global insertion and Hamiltonicity in DCT-graphs ⋮ Four sufficient conditions for hamiltonian graphs

This page was built for publication: An improvement of fraisse's sufficient condition for hamiltonian graphs