Hamiltonian Connectedness in Claw-Free Graphs

被引：0

作者：

Xiaodong Chen

Mingchu Li

Xin Ma

Xinxin Fan

机构：

[1] School of Software,Department of mathematics of Shenyang Jianzhu

[2] Dalian University of Technology,undefined

[3] University Urban Construction College,undefined

来源：

Graphs and Combinatorics | 2013年 / 29卷

关键词：

Locally ; -connected; Quasilocally 2-connected; Hamilton-connected; 68R10;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

If every vertex cut of a graph G contains a locally 2-connected vertex, then G is quasilocally 2-connected. In this paper, we prove that every connected quasilocally 2-connected claw-free graph is Hamilton-connected.

引用

页码：1259 / 1267

页数：8

共 13 条

[1]

Asratian A.S.(1996)Every 3-connected locally connected claw-free graph is Hamilton-connected J. Graph Theory 23 191-201

[2]

Broersma H.J.(1987)3-connected line graphs of triangular graphs are panconnected and 1-hamiltonian J. Graph Theory 11 399-407

[3]

Veldman H.J.(1979)A note on locally connected and Hamilton-connected graphs Israel J. Math 33 5-8

[4]

Chartrand G.(1981)Hamiltonian properties of connected, locally connected graphs Congr. Numer. 32 199-204

[5]

Gould R.J.(1984)Connected locally 2-connected J. Graph Theory 8 347-353

[6]

Polimeni A.D.(1999)-free graphs are panconnected Discrete. Math 203 253-260

[7]

Clark L.(1989)Panconnectivity of locally connected claw-free graphs Discrete. Math 78 307-313

[8]

Kanetkar S.V.(undefined)Cycles of given length in some undefined undefined undefined-undefined

[9]

Rao P.R.(undefined)-free graphs undefined undefined undefined-undefined

[10]

Sheng Y.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →