Abstract
Abull is the (self-complementary) graph with verticesa, b, c, d, e and edgesab, ac, bc, bd, ce; a graphG is calledBerge if neitherG not its complement contains a chordless cycle whose length is odd and at least five. We prove that bull-free Berge graphs are perfect; a part of our argument relies on a new property of minimal imperfect graphs.
Similar content being viewed by others
References
Chvátal, V.: Star-cutsets and perfect graphs. J. Comb. Theory (B)39, 189–199 (1985)
Lovász, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math.2, 253–267 (1972)
Olariu, S.: No antitwins in minimal imperfect graphs. J. Comb. Theory (B) (to appear)
Seinsche, D.: On a property of the class ofn-colorable graphs. J. Comb. Theory (B)16, 191–193 (1974)
Author information
Authors and Affiliations
Additional information
This work was done while both authors were at the School of Computer Science, McGill University; support by NSERC is gratefully acknowledged.
Rights and permissions
About this article
Cite this article
Chvátal, V., Sbihi, N. Bull-free Berge graphs are perfect. Graphs and Combinatorics 3, 127–139 (1987). https://doi.org/10.1007/BF01788536
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788536