Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,002,168 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Bull graph
Claw-free graph
Complement graph
Cycle (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2019
Highly Cited
2019
The strong perfect graph theorem
A. M. Murray
100 Years of Math Milestones
2019
Corpus ID: 37742171
In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect…
Expand
2012
2012
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
A. Brandstädt
,
V. Giakoumakis
,
Frédéric Maffray
Discrete Applied Mathematics
2012
Corpus ID: 1499052
Highly Cited
2005
Highly Cited
2005
Recognizing Berge Graphs
M. Chudnovsky
,
G. Cornuéjols
,
Xinming Liu
,
P. Seymour
,
K. Vuskovic
Comb.
2005
Corpus ID: 2229369
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
Review
2003
Review
2003
Progress on perfect graphs
M. Chudnovsky
,
N. Robertson
,
P. Seymour
,
R. Thomas
Mathematical programming
2003
Corpus ID: 5226655
Abstract. A graph is perfect if for every induced subgraph, the chromatic number is equal to the maximum size of a complete…
Expand
Highly Cited
1996
Highly Cited
1996
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs
L. Kroon
,
Arunabha Sen
,
H. Deng
,
A. Roy
International Workshop on Graph-Theoretic…
1996
Corpus ID: 239843
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
1987
Highly Cited
1987
Coloring perfect (K4 - e)-free graphs
A. Tucker
Journal of combinatorial theory. Series B (Print)
1987
Corpus ID: 35679613
Highly Cited
1987
Highly Cited
1987
A semi-strong Perfect Graph theorem
B. Reed
Journal of combinatorial theory. Series B (Print)
1987
Corpus ID: 33327160
1979
1979
Combinatorial designs related to the strong perfect graph conjecture
V. Chvátal
,
R. Graham
,
André F. Perold
,
S. Whitesides
Discrete Mathematics
1979
Corpus ID: 16522945
Highly Cited
1975
Highly Cited
1975
A class of facet producing graphs for vertex packing polyhedra
L. Trotter
Discrete Mathematics
1975
Corpus ID: 44592050
Highly Cited
1974
Highly Cited
1974
Perfect zero–one matrices
M. Padberg
Mathematical programming
1974
Corpus ID: 26827058
A zero–one matrix is called perfect if the polytope of the associated set packing problem has integral vertices only. By this…
Expand
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)
ACCEPT & CONTINUE