✦ LIBER ✦

A new class of perfect Hoàng graphs

✍ Scribed by Irena Rusu

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 314 KB
Volume: 145
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00093-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New classes of Berge perfect graphs

✍ C. De Simone; A. Galluccio 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 823 KB

In this paper we prove the validity of the Strong Perfect Graph Conjecture for some classes of graphs described by forbidden configurations. Three different kinds of techniques are used: the first is the well-known star-cutset technique, the second involves a clique-reduction operation, and the thi

A class of strongly perfect graphs

✍ M. Preissmann 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 154 KB

New properties of perfectly orderable gr

New properties of perfectly orderable graphs and strongly perfect graphs

✍ Chính T. Hoàng; Frédéric Maffray; Myriam Preissmann 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 893 KB

On a class of kernel-perfect and kernel-

On a class of kernel-perfect and kernel-perfect-critical graphs

✍ Kiran B. Chilakamarri; Peter Hamburger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or

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