Title
S-strongly perfect Cartesian product of graphs
Abstract
The study of perfectness, via the strong perfect graph conjecture, has given rise to numerous investigations concerning the structure of many particular classes of perfect graphs. In "Perfect Product Graphs" (Discrete Mathematics, Vol. 20, 1977, pp. 177-186), G. Ravindra and K.R. Parthasarathy tried, but unfortunately without success, to characterize the perfectness of the cartesian product of graphs (see also MR No. 58-10567, 1979). In this paper we completely characterize the graphs that are both nontrivial cartesian products and s-strongly perfect.
Year
DOI
Venue
1992
10.1002/jgt.3190160403
Journal of Graph Theory
Keywords
DocType
Volume
s-strongly perfect cartesian product
Journal
16
Issue
ISSN
Citations 
4
0364-9024
0
PageRank 
References 
Authors
0.34
1
2
Name
Order
Citations
PageRank
Elefterie Olaru183.85
Eugen Mândrescu200.34