1988 | OriginalPaper | Buchkapitel
Berge’s Strong Perfect Graph Conjecture for 4-Chromatic Graphs
verfasst von : S. M. Baas
Erschienen in: DGOR/NSOR
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Berge’s well known conjecture (SPGC) can be formulated as follows: “A graph G is perfect if and only if it contains neither an odd hole nor an odd anti-hole”. In this formulation an odd hole is a chordless circuit on an odd number of nodes and an odd anti-hole the complement of an odd hole. In the past the conjecture has been verified for several classes of graphs, among which planar and 3-chromatic graphs.