Every 3-connected, essentially 11-connected line graph is Hamiltonian

被引：17

作者：

Lai, HH ^{[1
]}

Shao, YH

Wu, HH

Zhou, J

机构：

[1] W Virginia Univ, Dept Math, Morgantown, WV 26506 USA

[2] Ohio Univ So, Ironton, OH 45638 USA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2006年 / 96卷 / 04期

关键词：

line graph; claw-free graph; super-Eulerian graphs; collapsible graph; Hamiltonian graph; dominating Eulerian subgraph; essential connectivity;

D O I：

10.1016/j.jctb.2005.11.002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Thomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G is essential if G-X has at least two non-trivial components. We prove that every 3-connected. essentially 11-connected line graph is Hamiltonian. Using Ryjcaek's line graph closure. it follows that every 3-connected. essentially 11-connected claw-free graph is Hamiltonian. (C) 2005 Elsevier Inc. All rights reserved.

引用

页码：571 / 576

页数：6

共 50 条

[1] Every 3-connected essentially 10-connected line graph is Hamilton-connected
Li, Hao
Yang, Weihua
[J]. DISCRETE MATHEMATICS, 2012, 312 (24) : 3670 - 3674
[2] On 3-connected hamiltonian line graphs
Chen, Ye
Fan, Suohai
Lai, Hong-Jian
[J]. DISCRETE MATHEMATICS, 2012, 312 (11) : 1877 - 1882
[3] Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected
Vrana, Petr
Zhan, Xingzhi
Zhang, Leilei
[J]. DISCRETE MATHEMATICS, 2022, 345 (08)
[4] The cycle space of a 3-connected hamiltonian graph
Barovich, MV
Locke, SC
[J]. DISCRETE MATHEMATICS, 2000, 220 (1-3) : 13 - 33
[5] Hamiltonian connectedness in 3-connected line graphs
Lai, Hong-Jian
Shao, Yehong
Yu, Gexin
Zhan, Mingquan
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 982 - 990
[6] Every 3-connected, locally connected, claw-free graph is Hamilton-connected
Asratian, AS
[J]. JOURNAL OF GRAPH THEORY, 1996, 23 (02) : 191 - 201
[7] EVERY 4-CONNECTED LINE GRAPH OF A PLANAR GRAPH IS HAMILTONIAN
LAI, HJ
[J]. GRAPHS AND COMBINATORICS, 1994, 10 (03) : 249 - 253
[8] Every 3-Connected Claw-Free Z8-Free Graph Is Hamiltonian
Lai, Hong-Jian
Xiong, Liming
Yan, Huiya
Yan, Jin
[J]. JOURNAL OF GRAPH THEORY, 2010, 64 (01) : 1 - 11
[9] Every 3-connected distance claw-free graph is Hamilton-connected
Li, R
Schelp, RH
[J]. DISCRETE MATHEMATICS, 2003, 268 (1-3) : 185 - 197
[10] Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Lai, Hong-Jian
Shao, Yehong
Zhan, Mingquan
[J]. DISCRETE MATHEMATICS, 2008, 308 (22) : 5312 - 5316

← 1 2 3 4 5 →