✦ LIBER ✦

Tank-Ring Factors in Supereulerian Claw-Free Graphs

✍ Scribed by MingChu Li, Lifeng Yuan, He Jiang, Bing Liu, H. J. Broersma

Book ID: 120788670
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 255 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1117-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path factors in claw-free graphs

✍ Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Ma 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 93 KB

2-factors in claw-free graphs

✍ Roman Čada; Shuya Chiba; Kiyoshi Yoshimoto 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Connected even factors in claw-free grap

Connected even factors in claw-free graphs

✍ MingChu Li; Liming Xiong; H.J. Broersma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Circumferences of 2-factors in claw-free

Circumferences of 2-factors in claw-free graphs

✍ Čada, Roman; Chiba, Shuya 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 418 KB

On factors of 4-connected claw-free grap

On factors of 4-connected claw-free graphs

✍ H. J. Broersma; M. Kriesell; Z. Ryjác̆ek 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider the existence of several different kinds of factors in 4‐connected claw‐free graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4‐connected line graph is hamiltonian,

Triangles in claw-free graphs

✍ Hong Wang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 642 KB

A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to KI,3. Let k be a positive integer. Our main result is as follows: If G is a claw-free graph of order at least 3k and d(x) + d(y)>~3k + 1 for every pair of non-adjacent vertices x and y of G, then G contains k v