𝔖 Bobbio Scriptorium
✦   LIBER   ✦

BERGE'S STRONG PERFECT GRAPH CONJECTURE

✍ Scribed by Alan C. Tucker

Book ID
118717695
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
303 KB
Volume
319
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the strong perfect graph conjecture
On the strong perfect graph conjecture
✍ Stephan Olariu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 384 KB

A graph G is perfect if for every induced subgraph H of G the chromatic number x(H) equals the largest number w ( H ) of pairwise adjacent vertices in H. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement C contains an odd cho

On the Berge's strong path partition con
On the Berge's strong path partition conjecture
✍ S. Sridharan πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 312 KB

Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa

Even pairs and the strong perfect graph
Even pairs and the strong perfect graph conjecture
✍ Stefan Hougardy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 130 KB

We will characterize all graphs that have the property that the graph and its complement are minimal even pair free. This characterization allows a new formulation of the Strong Perfect Graph Conjecture. The reader is assumed to be familiar with perfect graphs (see e.g. [2]). A hole is a cycle of l