A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity

zbMath1431.05089arXiv1804.01258MaRDI QIDQ5210982

Michitaka Furuya, Masao Tsugaki, Shuya Chiba, Tomoki Yamashita, Kenta Ozeki

Publication date: 17 January 2020

Full work available at URL: https://arxiv.org/abs/1804.01258

zbMATH Keywords

Hamilton cycledegree sum condition

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• A degree sum condition concerning the connectivity and the independence number of a graph
• A generalization of a result of Häggkvist and Nicoghossian
• A remark on two sufficient conditions for Hamilton cycles
• Cycles through prescribed vertices with large degree sum
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity