𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected even factors in claw-free graphs

✍ Scribed by MingChu Li; Liming Xiong; H.J. Broersma

Book ID
108113826
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
128 KB
Volume
308
Category
Article
ISSN
0012-365X

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,

Quadrangularly connected claw-free graph
Quadrangularly connected claw-free graphs
✍ MingChu Li; Cheng Guo; Liming Xiong; Dengxin Li; Hong-Jian Lai πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 187 KB
Even Pairs in Claw-Free Perfect Graphs
Even Pairs in Claw-Free Perfect Graphs
✍ ClΓ‘udia Linhares Sales; FrΓ©dΓ©ric Maffray πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 424 KB

An even pair in a graph is a pair of non-adjacent vertices such that every chordless path between them has even length. A graph is called strict quasi-parity when every induced subgraph that is not a clique has an even pair, and it is called perfectly contractile when every induced subgraph can be t

9-Connected Claw-Free Graphs Are Hamilto
9-Connected Claw-Free Graphs Are Hamilton-Connected
✍ Stephan Brandt πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l