Essential independent sets and Hamiltonian cycles

DOI<242::AID-JGT15>3.0.CO;2-L 10.1002/(SICI)1097-0118(199602)21:2<242::AID-JGT15>3.0.CO;2-LzbMath0839.05067OpenAlexW2025903184MaRDI QIDQ4865533

Yoshimi Egawa, Xin Liu, Akira Saito, Guantao Chen

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<242::aid-jgt15>3.0.co;2-l

zbMATH Keywords

distanceconnectivitylongest cyclehamiltonian cycleessential independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs ⋮ An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian ⋮ New sufficient condition for Hamiltonian graphs

This page was built for publication: Essential independent sets and Hamiltonian cycles