Strongly perfect graphs were introduced by C. Berge and P. Duchet in [1]. In [4], [3] the following was studied: the problem of strong perfectness for the Cartesian product, the tensor product, the symmetrical difference of n, n ≥ 2, graphs and for the generalized Cartesian product of graphs. Co-strong perfectness was first studied by G. Ravindra andD. Basavayya [5]. In this paper we discuss strong perfectness and co-strong perfectness for the generalized composition (the lexicographic product) of graphs named as the X-join of graphs.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1030,
author = {Alina Szelecka and Andrzej W\l och},
title = {A note on strong and co-strong perfectness of the X-join of graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {16},
year = {1996},
pages = {151-155},
zbl = {0877.05049},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1030}
}
Alina Szelecka; Andrzej Włoch. A note on strong and co-strong perfectness of the X-join of graphs. Discussiones Mathematicae Graph Theory, Tome 16 (1996) pp. 151-155. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1030/
[000] [1] C. Berge and P. Duchet, Strongly perfect graphs, Ann. Disc. Math. 21 (1984) 57-61. | Zbl 0558.05037
[001] [2] M. Borowiecki and A. Szelecka, One factorizations of the generalized Cartesian product and of the X-join of regular graphs, Discussiones Mathematicae 13 (1993) 15-19. | Zbl 0794.05099
[002] [3] M. Kwaśnik and A. Szelecka, Strong perfectness of the generalized Cartesian product of graphs, accepted for publication in the special issue of Discrete Math., devoted to the Second Krako w Conference on Graph Theory, Zakopane 1994. | Zbl 0870.05027
[003] [4] E. Mandrescu, Strongly perfect product of graphs, Czech. Math. Journal, 41 (116) (1991) 368-372. | Zbl 0738.05073
[004] [5] G. Ravindra and D. Basavayya, Co-strongly perfect bipartite graphs, Jour. Math. Phy. Sci. 26 (1992) 321-327. | Zbl 0771.05086