✦ LIBER ✦

Traceability in Small Claw-Free Graphs

✍ Scribed by John M. Harris; Michael J. Mossinghoff

Book ID: 108497953
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 277 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00080-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-traceability of large connected claw

Non-traceability of large connected claw-free graphs

✍ Frydrych, Wac?w; Skupie?, Zdzis?aw 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 3 views

Let G be a connected claw-free graph on n vertices. Let σ 3 (G) be the minimum degree sum among triples of independent vertices in G. It is proved that if σ 3 (G) ≥ n-3 then G is traceable or else G is one of graphs G n each of which comprises three disjoint nontrivial complete graphs joined togethe

A Note on Degree Conditions for Traceabi

A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs

✍ Roman Čada; Evelyne Flandrin; Haiyan Kang 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

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

Quasi-claw-free graphs

✍ A. Ainouche 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A graph G is quasi claw-free if it satisfies the property: This property is satisfied if in particular u does not center a claw (induced K1.3). Many known results on claw-free graphs, dealing with matching and hamiltonicity are extended to the larger class of quasi-claw-free graphs.

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

Clique minors in claw-free graphs

✍ Alexandra Fradkin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 301 KB