𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A revision and extension of results on 4-regular, 4-connected, claw-free graphs

✍ Scribed by Trevor J. Gionet Jr.; Erika L.C. King; Yixiao Sha

Book ID
108112936
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
219 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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,

Maximal K3's and Hamiltonicity of 4-conn
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim

Some results on the reconstruction probl
Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs
✍ Bhalchandra D. Thatte 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

## Abstract A claw is an induced subgraph isomorphic to K~1,3.~ The claw‐point is the point of degree 3 in a claw. A graph is called p‐claw‐free when no p‐cycle has a claw‐point on it. It is proved that for p ≥ 4, p‐claw‐free graphs containting at least one chordless p‐cycle are edge reconstructibl