Almost all Berge Graphs are Perfect
1992 ◽
Vol 1
(1)
◽
pp. 53-79
◽
Let Per f(n) denote the set of all perfect graphs on n vertices and let Berge(n) denote the set of all Berge graphs on n vertices. The strong perfect graph conjecture states that Per f(n) = Berge(n) for all n. In this paper we prove that this conjecture is at least asymptotically true, i.e. we show that
2012 ◽
Vol 21
(5)
◽
pp. 661-682
◽
Keyword(s):
Keyword(s):
1995 ◽
Vol 118
(1)
◽
pp. 1-5
◽
1996 ◽
Vol 119
(2)
◽
pp. 287-295
◽
Keyword(s):
2016 ◽
Vol 25
(5)
◽
pp. 700-743
◽
Keyword(s):
2016 ◽
Vol 94
(2)
◽
pp. 224-235
◽
1995 ◽
Vol 125
(5)
◽
pp. 911-929