An undirected graph is perfect if and only if its complement graph is also perfect
Two complementary perfect graphs
In graph theory, the perfect graph theorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph is also perfect. This result had been conjectured by Berge (1961, 1963), and it is sometimes called the weak perfect graph theorem to distinguish it from the strong perfect graph theorem[1] characterizing perfect graphs by their forbidden induced subgraphs.
^This was also conjectured by Berge but only proven much later by Chudnovsky et al. (2006).
and 21 Related for: Perfect graph theorem information
In graph theory, the perfectgraphtheorem of László Lovász (1972a, 1972b) states that an undirected graph is perfect if and only if its complement graph...
In graph theory, the strong perfectgraphtheorem is a forbidden graph characterization of the perfectgraphs as being exactly the graphs that have neither...
underlying graph from vertices into edges, and by Whitney's theorem the same translation can also be done in the other direction. Line graphs are claw-free...
perfect 1. A perfectgraph is a graph in which, in every induced subgraph, the chromatic number equals the clique number. The perfectgraphtheorem and...
graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph G = (V, E), a perfect matching...
is Dilworth's theorem; these facts, together with the perfectgraphtheorem can be used to prove Dilworth's theorem from Mirsky's theorem or vice versa...
forbidden graphs, the complete graph K5 and the complete bipartite graph K3,3. For Kuratowski's theorem, the notion of containment is that of graph homeomorphism...
discipline of graph theory the Tutte theorem, named after William Thomas Tutte, is a characterization of finite undirected graphs with perfect matchings....
bipartite graph. Hall's marriage theorem can be used to show that a k-regular bipartite graph contains a perfect matching. One can then remove the perfect matching...
the complement of a perfectgraph is also perfect is the perfectgraphtheorem of László Lovász. Cographs are defined as the graphs that can be built up...
1976, long before the proof of the strong perfectgraphtheorem completely characterized the perfectgraphs. The same result was independently discovered...
classes of perfectgraphs from which all others can be formed in the proof by Chudnovsky et al. (2006) of the Strong PerfectGraphTheorem. If a graph is both...
to the strong perfectgraphtheorem, induced cycles and their complements play a critical role in the characterization of perfectgraphs. Cliques and independent...
induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings...
if its complement is perfect, proven by László Lovász in 1972 and now known as the perfectgraphtheorem, and A graph is perfect if and only if neither...
Global Information