𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of claw-free -perfect graphs

✍ Scribed by T. Karthick; Frédéric Maffray

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Claw-free circular-perfect graphs
Claw-free circular-perfect graphs
✍ Arnaud Pêcher; Xuding Zhu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract The circular chromatic number of a graph is a well‐studied refinement of the chromatic number. Circular‐perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This article studies claw‐free circular‐perfect graphs. First, we prove that

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

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

On the choice number of claw-free perfec
On the choice number of claw-free perfect graphs
✍ Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.

Quasi-claw-free graphs
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.