Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Strong perfect graph theorem

Known as: Strong perfect graph conjecture 
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect… Expand
2015
2015
The clique numberωD of a digraph D is the size of the largest bidirectionally complete subdigraph ofi¾?D. D is perfect if, for… Expand
  • figure 1
  • figure 2
2012
2012
Clique separator decomposition, introduced by Whitesides and Tarjan, is one of the most important graph decompositions. A hole is… Expand
  • figure 1
Highly Cited
2005
Highly Cited
2005
A graph is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. In this paper we… Expand
2003
2002
2002
A graph is perfect if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of… Expand
Highly Cited
1996
Highly Cited
1996
In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the… Expand
Highly Cited
1990
Highly Cited
1990
A graph is 2K2-free if it does not contain an independent pair of edges as an induced subgraph. We show that if G is 2K2-free and… Expand
Highly Cited
1987
Highly Cited
1987
  • B. Reed
  • J. Comb. Theory, Ser. B
  • 1987
  • Corpus ID: 33327160
Abstract Perfect Graphs were defined by Claude Berge in 1961. Since that time this class of graphs has been intensely studied… Expand
Highly Cited
1974
Highly Cited
1974
A zero–one matrix is called perfect if the polytope of the associated set packing problem has integral vertices only. By this… Expand
  • figure 1