journal article
oaidoi:10.1016/0095-8956(87)90048-7

Coloring perfect (K4 − e)-free graphs

Authors
Publication date
30 June 1987
Publisher
Published by Elsevier Inc.
Doi

    Abstract

    AbstractThis 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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0095-8956(87)90048...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.