𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List monopolar partitions of claw-free graphs

✍ Scribed by Ross Churchley; Jing Huang

Book ID
113567425
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
193 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

List matrix partitions of chordal graphs
List matrix partitions of chordal graphs
✍ TomΓ‘s Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; FΓ‘bio Protti πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 265 KB
Hamilton connectivity of line graphs and
Hamilton connectivity of line graphs and claw-free graphs
✍ Zhiquan Hu; Feng Tian; Bing Wei πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(Ξ½) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≀ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co

A Description of Claw-Free Perfect Graph
A Description of Claw-Free Perfect Graphs
✍ FrΓ©dΓ©ric Maffray; Bruce A. Reed πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 249 KB

It is known that all claw-free perfect graphs can be decomposed via clique-cutsets into two types of indecomposable graphs respectively called elementary and peculiar (1988, V. Chva tal and N. Sbihi, J. Combin. Theory Ser. B 44, 154 176). We show here that every elementary graph is made up in a well