Closure, 2-factors, and cycle coverings in claw-free graphs

被引：0

作者：

Ryjácek, Z

Saito, A

Schelp, RH

机构：

[1] Nihon Univ, Dept Math, Setagaya Ku, Tokyo 1568550, Japan

[2] Univ W Bohemia, Dept Math, Plzen 30614, Czech Republic

[3] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA

来源：

JOURNAL OF GRAPH THEORY | 1999年 / 32卷 / 02期

关键词：

closure; claw-free graph; 2-factor; cycle covering;

D O I：

10.1002/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this article, we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217-224). For a claw-free graph G and its closure cl(G), we prove: (1) V(G) is covered by k cycles in G if and only if V(cl(G)) is covered by k: cycles of cl(G); and (2) G has a 2-factor with at most k components if and only if cl(G) has a 2-factor with at most k components. (C) 1999 John Wiley & Sons, Inc. J Graph Theory 32: 109-117, 1999.

引用

页码：109 / 117

页数：9