✦ LIBER ✦

Recognizing Dart-Free Perfect Graphs

✍ Scribed by Chvátal, V.; Fonlupt, J.; Sun, L.; Zemirline, A.

Book ID: 118180479
Publisher: Society for Industrial and Applied Mathematics
Year: 2002
Tongue: English
Weight: 252 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539799354771

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing bull-free perfect graphs

✍ Bruce Reed; Najiba Sbihi 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 528 KB

Square-free perfect graphs

✍ Michele Conforti; Gérard Cornuéjols; Kristina Vušković 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 627 KB

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

Coloring Bull-Free Perfect Graphs

✍ Penev, Irena 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

Optimizing Bull-Free Perfect Graphs

✍ de Figueiredo, Celina M. H.; Maffray, Frédéric 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 189 KB

Irredundance perfect andP6-free graphs

✍ Puech, Jo�l 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 2 views

The domination number γ(G) and the irredundance number ir(G) of a graph G have been considered by many authors. It is well known that ir(G) ≤ γ(G) holds for all graphs G, which leads us to consider the concept of irredundance perfect graphs: graphs that have all their induced subgraphs satisfying th