Induced nets and Hamiltonicity of claw-free graphs
Induced nets and Hamiltonicity of claw-free graphs
复制标题
无爪图的诱导网和哈密顿度
DOI：
10.1007/s00373-020-02265-7
复制
发表时间：
2021
影响因子：
0.7
通讯作者：
J. Fujisawa
中科院分区：
文献类型：
--
作者：
S. Chiba;J. Fujisawa
度序列为3，3，3，1，1，1的连通图称为网，网中度为1的顶点称为网的端点。Broersma在1993年证明了一个无诱导的2连通图G是Hamilton图，如果G的每个诱导网的每个端点都至少有度.本文证明了这一猜想是肯定的。
The connected graph of degree sequence 3, 3, 3, 1, 1, 1 is calleda net, and the vertices of degree 1 in a net are called its endvertices. Broersma conjectured in 1993 that a 2-connected graphGwith no inducedis hamiltonian if every endvertex of each induced net ofGhas degree at least. In this paper we prove this conjecture in the affirmative.