Skip to main navigation Skip to search Skip to main content

Coloring perfect (K4 - e)-free graphs

Research output: Contribution to journal › Article › peer-review

60 Scopus citations

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 languageEnglish
Pages (from-to)313-318
Number of pages6
JournalJournal of Combinatorial Theory, Series B
Volume42
Issue number3
DOIs
StatePublished - Jun 1987

Fingerprint

Dive into the research topics of 'Coloring perfect (K4 - e)-free graphs'. Together they form a unique fingerprint.

Cite this