𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new characterization of perfect graphs

✍ Scribed by Hortensia Galeana-Sánchez

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of domination perfect
A characterization of domination perfect graphs
✍ I. E. Zverovich; V. E. Zverovich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Let u(G) and i(G) be the domination number and independent domination number of a graph G. respectively. Sumner and Moore [8] define a graph G to be domination perfect if y( H) = i( H), for every induced subgraph H of G. In this article, we give a finite forbidden induced subgraph characterization o

A Characterization of b-Perfect Graphs
A Characterization of b-Perfect Graphs
✍ Chính T. Hoàng; Frédéric Maffray; Meriem Mechebbek 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract A b‐coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b‐chromatic number of a graph __G__ is the largest integer __k__ such that __G__ admits a b‐coloring with __k__ colors. A graph is b

Skeletal graphs — a new class of perfect
Skeletal graphs — a new class of perfect graphs
✍ A. Hertz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Let S be an arbitrary collection of stars in a graph G such that there is no chain of length ~3 joining the centers of (any) two stars in G. We consider the graphs that can be obtained by deleting in a parity graph all the edges of such a set S. These graphs will be called skeletal graphs and we pro