2012年5月
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
JOURNAL OF GRAPH THEORY
- ,
- 巻
- 70
- 号
- 1
- 開始ページ
- 40
- 終了ページ
- 53
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1002/jgt.20599
- 出版者・発行元
- WILEY-BLACKWELL
Let cl(G) denote Ryjacek's closure of a claw-free graph G. In this article, we prove the following result. Let G be a 4-connected claw-free graph. Assume that G[NG(T)] is cyclically 3-connected if T is a maximal K3 in G which is also maximal in cl(G). Then G is hamiltonian. This result is a common generalization of Kaiser et al.'s theorem [J Graph Theory 48(4) (2005), 267276] and Pfender's theorem [J Graph Theory 49(4) (2005), 262272]. (c) 2011 Wiley Periodicals, Inc. J Graph Theory
- リンク情報
- ID情報
-
- DOI : 10.1002/jgt.20599
- ISSN : 0364-9024
- Web of Science ID : WOS:000302799000004