Skip to search formSkip to main contentSkip to account menu

Perfect graph theorem

In graph theory, the perfect graph theorem of László Lovász (, ) states that an undirected graph is perfect if and only if its complement graph is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Clique (graph theory)Clique coverComplement graphEternal dominating set

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A comparison between lift-and-project indices and imperfection ratio on web graphs
2008
2008
Perfect and precisely perfect fuzzy graphs
In this paper, we consider two different definitions of adjacency in fuzzy graph. Thus any graph theory concept that can be… 
2007
2007
Characterizations of Total Dual Integrality ?
In this paper we provide new characterizing properties of TDI systems, among others the following: A system of linear… 
2004
2004
Note on Lift-and-Project Ranks and Antiblocker Duality
2002
2002
Perfect Binary Matroids
In this paper a definition of perfect binary matroids is considered and it is shown that, analogous to the Perfect Graph Theorem… 
1991
1991
Perfect graphs and norms
AbstractFor a given undirected graphG=(V, Г) withn vertices we define four norms on ℝn, namely, where ℰ (resp.) stands for the… 
1989
1989
Opposition graphs are strict quasi-parity graphs
An opposition graph is a graph whose edges can be acyclically oriented in such a way that every chordless path on four vertices… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)