On subgraphs of Cartesian product graphs and S-primeness
✍ Scribed by Boštjan Breš;ar
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 265 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show that if G is a connected graph with the same proper convex subgraphs as (Kn)', the Cartesian product of r copies of Kn, r >t 2, n >t 3, then [V(G)I ~> n" with equality if and only if G is isomorphic to (Kn)'. In this note we consider only connected finite undirected simple graphs. The compl
## 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.