Type: Article
Publication Date: 1992-08-01
Citations: 3
DOI: https://doi.org/10.1017/s1446788700035357
Abstract A complementary decomposition of λ K n into a graph G is an edge-disjoint decomposition of λ K n into copies of G such that if each copy H of G is replaced by its complement in V(H) then the result is an edge-disjoint decomposition of λ K n into copies of G C it is a self- complementary decomposition if G = G c . The spectrum for the last self-complementary graph on at most 7 vertices is found.
Action | Title | Year | Authors |
---|---|---|---|
+ PDF Chat | Large set of P<sub>3</sub>‐decompositions | 2002 |
Qingde Kang Yànfāng Zhāng |
+ | Edge-colored cube decompositions | 2006 |
Peter D. Adams Darryn Bryant Heather Jordon |
+ | On large sets ofPk-decompositions | 2005 |
Yànfāng Zhāng |