Essential independent sets and Hamiltonian cycles

DOI10.1002/(SICI)1097-0118(199602)21:2%3C242::AID-JGT15%3E3.0.CO;2-LzbMATH Open0839.05067OpenAlexW2025903184MaRDI QIDQ4865533FDOQ4865533

Authors Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito 

Publication date 25 February 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C242::aid-jgt15%3E3.0.co;2-l

zbMATH Keywords

distanceconnectivitylongest cyclehamiltonian cycleessential independent set

Mathematics Subject Classification ID

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

Recommendations

• Essential independent sets and long cycles
• scientific article; zbMATH DE number 2016766
• scientific article; zbMATH DE number 2121599
• A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
• A note on the Song-Zhang theorem for Hamiltonian graphs

Cited In (13)

• Essential independent sets and long cycles
• Title not available (Why is no real title available?)
• A note on the Song-Zhang theorem for Hamiltonian graphs
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• Independent sets, cliques and hamiltonian graphs
• New sufficient condition for Hamiltonian graphs
• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• Title not available (Why is no real title available?)
• A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
• Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)

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

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