✦ LIBER ✦

Neighborhood intersections and Hamiltonicity in almost claw-free graphs

✍ Scribed by Mingquan Zhan

Book ID: 108315620
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 171 KB
Volume: 243
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00469-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Toughness and hamiltonicity in almost cl

Toughness and hamiltonicity in almost claw-free graphs

✍ Broersma, H.J.; Ryj�?ek, Z.; Schiermeyer, I. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 3 views

Some known results on claw-free (Kl,3-free) graphs are generalized to the larger class of almost claw-free graphs which were introduced by RyjaEek. In particular, w e show that a 2-connected almost claw-free graph is I-tough, and that a 2-connected almost claw-free graph on n vertices is hamiltonian

Neighborhood union of independent sets a

Neighborhood union of independent sets and hamiltonicity of claw-free graphs

✍ Xinping Xu 📂 Article 📅 2005 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 257 KB

Mengerian properties, hamiltonicity, and

Mengerian properties, hamiltonicity, and claw-free graphs

✍ E. Flandrin; H. Li 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 603 KB

Almost claw-free graphs

✍ Zdeněk Ryjáček 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

## Abstract We say that __G__ is almost claw‐free if the vertices that are centers of induced claws (__K__~1,3~) in __G__ are independent and their neighborhoods are 2‐dominated. Clearly, every claw‐free graph is almost claw‐free. It is shown that (i) every even connected almost claw‐free graph has

Hamiltonicity in claw-free graphs throug

Hamiltonicity in claw-free graphs through induced bulls

✍ Zdeněk Ryjáček 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views