G-decomposition of Kn, where G has four vertices or less |
| |
| Authors: | J.C. Bermond J. Schönheim |
| |
| Affiliation: | Centre de Mathématique Sociale, Paris, France;The University of Tel Aviv, Department of Mathematics, Statistics and Computing Science, Tel Aviv, Israel |
| |
| Abstract: | The complete graph Kn, is said to have a G-decomposition if it is the union of edge disjoint subgraphs each isomorphic to G. The set of values of n for which Kn has a G-decomposition is determined if G has four vertices or less. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
