Abstract
The aim of this paper is to prove that the normal product of two t-perfect graphs is strongly perfect. This implies a result of Ravindra, [8], about perfectness of the normal product of such graphs. A characterization of the t-perfectness is also obtained.
Similar content being viewed by others
References
Berge,. C.: Graphs and Hypergraphs. Amsterdam: North-Holland 1973
Berge, C., Duchet, P.: Strongly perfect graphs. Annals of Discrete Math. 21, 57–61 (1984)
Choudum, S.A., Parthasarathy, K.R., Ravindra, G.: Line-clique cover number of a graph. Proc. Indian Nat. Sei. Acad. Part A 41(3), 289–293 (1975)
Golumbic, M.C.: Algorithmic graph theory and perfect graphs. London: Academic Press 1980
Mândrescu, E.: Operations with perfect graphs (in Romanian), Ph.D. Thesis, University of Bucharest, 1993
Olaru, E.: Über die Überdeckung von Graphen mit Cliquen. Wiss. Z. Tech. Höchst. Ilmenau 15, 115–121 (1969)
Olaru, E., Mândrescu, E.: On stable transversal and strong perfectness of graph-join. An. Univ. Galatzi, fasc. II, anul IV(X) (1987), 6–9
Ravindra, G.: Perfectness of normal products of graphs. Discrete Math. 24, 291–298 (1978)
Sabidussi, S.: Graph derivatives. Math. Z. 76, 385–401 (1961)
Wolk, E.S.: A note on the comparability graph of a tree. Proc. Amer. Math. Soc. 16, 17–20 (1965)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alexe, G., Olaru, E. The Strongly Perfectness of Normal Product of t-Perfect Graphs. Graphs and Combinatorics 13, 209–215 (1997). https://doi.org/10.1007/BF03352997
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03352997