文献类型：期刊文献

英文题名：Cyclable sets of vertices in 3-connected graphs

作者：Li, Hao[1,2,3];Zhu, Yan[1,2,4]

机构：[1]CNRS, UMR 6823, Lab Rech Informat, F-91405 Orsay, France;[2]Univ Paris 11, Univ Paris Saclay, F-91405 Orsay, France;[3]Jianghan Univ, Inst Interdisciplinary Res, Wuhan 430056, Peoples R China;[4]East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2016

卷号：7

期号：2-3

起止页码：495

外文期刊名：JOURNAL OF COMBINATORICS

收录：WOS:【ESCI(收录号:WOS:000387160600015)】；

语种：英文

摘要：Given a graph G, a set S subset of V (G) is called cyclable (in G) if G has a cycle containing every vertex of S; G is hamiltonian if V (G) is cyclable in G. Beginning with a result of Dirac in 1952, many results on sufficient conditions that relate degree sum and neighborhood conditions for hamiltonicity and cyclability, have been obtained. We give a new sufficient condition on degree sums and neighborhoods of any four independent vertices in a graph. We also study the extremal cases of this condition.