Abstract
We say that a vertexx of a graph is predominant if there exists another vertexy ofG such that either every maximum clique ofG containingy containsx or every maximum stable set containingx containsy. A graph is then called preperfect if every induced subgraph has a predominant vertex. We show that preperfect graphs are perfect, and that several well-known classes of perfect graphs are preperfect. We also derive a new characterization of perfect graphs.
Similar content being viewed by others
References
C. Berge: Färbung von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind (Zusammenfassung)Wiss. Z. Natrin Luther Univ. Math.-Natur. Reihe 10 (1961), 114–115.
C. Berge:Graphs, North Holland, Amsterdam, New York, 1985.
C. Berge, andV. Chvátal (editors),Topics on perfect graphs. North Holland, Amsterdam, 1984.
C. Berge, andP. Duchet: Strongly perfect graphs. In:Topics on perfect graphs, C. Berge and V. Chvátal, editors, 57–61. North Holland, Amsterdam, 1984.
M. Burlet, andJ. P. Uhry: Parity graphs. In:Topics on perfect graphs, C. Berge and V. Chvátal, editors,Ann. Discrete Math. 21, North Holland, Amsterdam, 1984.
R. P. Dilworth: A decomposition theorem for partially irdered sets.Annals of Math. 51 (1950), 161–166.
T. Gallai: Graphen mit triangulierbaren ungeraden Vielecken.Magyar Tud. Akad. Kutató Int. Közl. 7 (1962), 3–36.
M. C. Golumbic:Algorithmic graph theorey and perfect graphs, Academic Press, New York, 1980.
A. Hajnal: A theorem onk-saturated graphs.Cancadian J. of Math.,17 (1965), 720–724.
R. Hayward, C. T. Hoàng, andF. Maffray: Optimizing weakly triangulated graphs.Graphs and Combinatorics 5 (1989), 339–349.
C. T. Hoàng, andF. Maffray: Opposition graphs are quasi-parity graphs.Graphs and Combinatorics 5 (1989), 83–85.
L. Lovász: A characterization of perfect graphs.J. Comb. Theory B 13 (1972), 95–98.
L. Lovász: Normal hypergraphs and the perfect graph conjecture.Discrete Math 2 (1972), 253–267.
H. Meyniel: A new property of critical imperfect graphs and some consequences.European J. of Combinatorics 8 (1987), 313–316.
E. Olaru: Über die Überdeckung von Graphen mit Cliquen.Wiss. Z. Tech. Hochsch. Ilmenau 15 (1969), 115–121.
M. W. Padberg: A characterization of perfect matrices. In C. Berge and V. Chvátal, editors,Topics on perfect graphs, 169–178. North Holland, Amsterdam, 1984.