𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Strongly Perfectness of Normal Product oft-Perfect Graphs

✍ Scribed by Gabriela Alexe,E. Olaru

Book ID
126339570
Publisher
Springer Japan
Year
1997
Tongue
English
Weight
873 KB
Volume
13
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

s-strongly perfect cartesian product of
s-strongly perfect cartesian product of graphs
✍ 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.

A class of strongly perfect graphs
A class of strongly perfect graphs
✍ M. Preissmann πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 154 KB
Normal fraternally orientable graphs sat
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
✍ H. Galeana-SΓ‘nchez πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 718 KB

The chromatic number x of a graph G is the minimum number of colors necessary to color the vertices of G such that no two adjacent vertices are colored alike. The clique number 01 of a graph G is the maximum number of vertices in a complete subgraph of G. A graph G is said to be perfect if x(H) =m(H

Perfect ΞΊ-Normality of Product Spaces
Perfect ΞΊ-Normality of Product Spaces
✍ HARUTO OHTA; MASAMI SAKAI; KEN-ICHI TAMANO πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 549 KB
A characterization of normal fraternally
A characterization of normal fraternally orientable perfect graphs
✍ H. Galeana-SΓ‘nchez πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 255 KB

While the famous Berge's Strong Perfect Graph Conjecture remains a major unsolved problem in Graph Theory, the following alternative characterization of perfect graphs was conjectured in 1982 by C. Berge and P. Duchet: A graph G is perfect if and only if any normal orientation of G is kernel-perfect