Claw-free 3-connected P11-free graphs are Hamiltonian

被引：13

作者：

Luczak, T ^{[1
]}

Pfender, F

机构：

[1] Adam Mickiewicz Univ, Dept Discrete Math, PL-61614 Poznan, Poland

[2] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

来源：

JOURNAL OF GRAPH THEORY | 2004年 / 47卷 / 02期

关键词：

Hamilton cycle; claw-free graphs; forbidden subgraphs;

D O I：

10.1002/jgt.20019

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We show that every 3-connected claw-free graph which contains no induced copy of P-11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P-12 this result is, in a way, best possible. (C) 2004 Wiley Periodicals, Inc.

引用

页码：111 / 121

页数：11

共 50 条

[41] Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs
李明楚
Transactions of Tianjin University, 2003, (04) : 273 - 278
[42] Hamiltonian Connectedness in 4-Connected Hourglass-free Claw-free Graphs
Li, MingChu
Chen, Xiaodong
Broersma, Hajo
JOURNAL OF GRAPH THEORY, 2011, 68 (04) : 285 - 298
[43] Every 3-connected distance claw-free graph is Hamilton-connected
Li, R
Schelp, RH
DISCRETE MATHEMATICS, 2003, 268 (1-3) : 185 - 197
[44] REMARKS ON HAMILTONIAN PROPERTIES OF CLAW-FREE GRAPHS
AINOUCHE, A
BROERSMA, HJ
VELDMAN, HJ
ARS COMBINATORIA, 1990, 29C : 110 - 121
[45] Hamiltonian cycles in almost claw-free graphs
Li, MC
GRAPHS AND COMBINATORICS, 2001, 17 (04) : 687 - 706
[46] The Cycle Spectrum of Claw-free Hamiltonian Graphs
Eckert, Jonas
Joos, Felix
Rautenbach, Dieter
GRAPHS AND COMBINATORICS, 2016, 32 (01) : 93 - 101
[47] NEIGHBORHOOD CONDITIONS FOR CLAW-FREE HAMILTONIAN GRAPHS
HAO, L
VIRLOUVET, C
ARS COMBINATORIA, 1990, 29A : 109 - 116
[48] Hamiltonian Cycles in Almost Claw-Free Graphs
MingChu Li
Graphs and Combinatorics, 2001, 17 : 687 - 706
[49] The Cycle Spectrum of Claw-free Hamiltonian Graphs
Jonas Eckert
Felix Joos
Dieter Rautenbach
Graphs and Combinatorics, 2016, 32 : 93 - 101
[50] Every 3-connected, locally connected, claw-free graph is Hamilton-connected
Asratian, AS
JOURNAL OF GRAPH THEORY, 1996, 23 (02) : 191 - 201

← 1 2 3 4 5 →