✦ LIBER ✦

Longest Cycles in Almost Claw-Free Graphs

✍ Scribed by MingChu Li

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 192 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730070024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian Cycles in Almost Claw-Free G

Hamiltonian Cycles in Almost Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 209 KB

Longest cycles in regular 2-connected cl

Longest cycles in regular 2-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 884 KB

In this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min {4k-2, n} (k >~ 8), and this result is best possible. ## I. Introduction All graphs considered here are undirected and finite, without loops or multiple edges. A graph G is

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

Hamilton cycles in claw-free graphs

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

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

Longest paths and cycles in K1,3-free gr

Longest paths and cycles in K1,3-free graphs

✍ Manton M. Matthews; David P. Sumner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

In this article w e show that the standard results concerning longest paths and cycles in graphs can be improved for K,,,-free graphs. We obtain as a consequence of these results conditions for the existence of a hamiltonian path and cycle in K,,,-free graphs.