Independent sets, cliques and hamiltonian graphs

DOI10.1007/BF01793014zbMATH Open0835.05043OpenAlexW2052598659MaRDI QIDQ1900523FDOQ1900523

Authors Xin Liu

Publication date 8 April 1996

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01793014

zbMATH Keywords

hamiltonian graphsessential independent set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Essential independent sets and Hamiltonian cycles
• scientific article; zbMATH DE number 1109411
• Publication:4940092
• scientific article; zbMATH DE number 2121599
• A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs

Cites work

• A note on Hamiltonian circuits
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• New sufficient conditions for cycles in graphs

Cited in

(1)

• On Independent Sets and Bicliques in Graphs

This page was built for publication: Independent sets, cliques and hamiltonian graphs

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