Perfect graphs: a survey
Combinatorics
2015-05-25 v7 Discrete Mathematics
Abstract
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002, and is now called the strong perfect graph theorem. This is a survey about perfect graphs, mostly focused on the strong perfect graph theorem.
Keywords
Cite
@article{arxiv.1301.5149,
title = {Perfect graphs: a survey},
author = {Nicolas Trotignon},
journal= {arXiv preprint arXiv:1301.5149},
year = {2015}
}
Comments
52 pages; published in Topics in Chromatic Graph Theory, Cambridge University Press, 2015, pp. 137-160