A note on strong perfectness of graphs
β Scribed by M. Preissmann; D. de Werra
- Book ID
- 110573047
- Publisher
- Springer-Verlag
- Year
- 1985
- Tongue
- English
- Weight
- 263 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect. The special case of the result is the known theorem concerning the Cartesian product of two graphs.
In this paper we explore the c:oncept of factoring a graph into non-isomorphic paths. Lel Pi denote the path of length i. We SAY that a graph G having $n(n + 1) edges is path-perfect if E( G) can be partitioned as E, UE, !J l \* l U & such that the subgraph of G induced by 32i is isomorphic to Pr, f
## Abstract __Ki__βperfect graphs are a special instance of __F β G__ perfect graphs, where __F__ and __G__ are fixed graphs with __F__ a partial subgraph of __G.__ Given __S__, a collection of __G__βsubgraphs of graph __K__, an __F β G__ cover of __S__ is a set of __T__ of __F__βsubgraphs of __K__