The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ Scribed by R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito

• Publisher: John Wiley and Sons
• Year: 2010
• Tongue: English
• Weight: 130 KB
• Volume: 68
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/jgt.20541

✦ Synopsis

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.