Perfect graphs: a survey
From MaRDI portal
Publication:6238942
arXiv1301.5149MaRDI QIDQ6238942FDOQ6238942
Authors: Nicolas Trotignon 
Publication date: 22 January 2013
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.
This page was built for publication: Perfect graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238942)
