𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A class of strongly perfect graphs

✍ Scribed by M. Preissmann


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
154 KB
Volume
54
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A decomposition for strongly perfect gra
✍ Stephan Olariu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 554 KB

A graph G is strongly perfect if every induced subgraph H of G contains a stable set that meets all the maximal cliques of H . We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G = (V, €1 is a partition of V into nonempty disjoint su

Skeletal graphs β€” a new class of perfect
✍ 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

s-strongly perfect cartesian product of
✍ Elefterie Olaru; Eugen Mǎndrescu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 308 KB

## Abstract The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In β€œPerfect Product Graphs” (__Discrete Mathematics__, Vol. 20, 1977, pp. 177‐‐186), G. Ravindra and K. R.

On a class of kernel-perfect and kernel-
✍ 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