Abstract
This note proves the Strong Perfect Graph Conjecture for (K4 - e)-free graphs from first principles. The proof directly yields an O(pn2) algorithm for p-coloring a perfect (K4 - e)-free graph.
| Original language | English |
|---|---|
| Pages (from-to) | 313-318 |
| Number of pages | 6 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 42 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 1987 |
Fingerprint
Dive into the research topics of 'Coloring perfect (K4 - e)-free graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver