Critical perfect graphs and perfect 3-chromatic graphs

Alan Tucker

doi:10.1016/0095-8956(77)90064-8

Critical perfect graphs and perfect 3-chromatic graphs

Alan Tucker

Applied Mathematics and Statistics

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

61 Scopus citations

Abstract

This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.

Original language	English
Pages (from-to)	143-149
Number of pages	7
Journal	Journal of Combinatorial Theory, Series B
Volume	23
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(77)90064-8
State	Published - Aug 1977

Access to Document

10.1016/0095-8956(77)90064-8

Cite this

@article{86cca678ca6847aab8c4cf2075555e6b,

title = "Critical perfect graphs and perfect 3-chromatic graphs",

abstract = "This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.",

author = "Alan Tucker",

year = "1977",

month = aug,

doi = "10.1016/0095-8956(77)90064-8",

language = "English",

volume = "23",

pages = "143--149",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

number = "1",

}

TY - JOUR

T1 - Critical perfect graphs and perfect 3-chromatic graphs

AU - Tucker, Alan

PY - 1977/8

Y1 - 1977/8

N2 - This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.

AB - This paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.

UR - https://www.scopus.com/pages/publications/0000419393

U2 - 10.1016/0095-8956(77)90064-8

DO - 10.1016/0095-8956(77)90064-8

M3 - Article

AN - SCOPUS:0000419393

SN - 0095-8956

VL - 23

SP - 143

EP - 149

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

Critical perfect graphs and perfect 3-chromatic graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this