|
|||||
|
|
Decompositions of complete graphs into regular bichromatic factors |
|
| Authors: | Anton Kotzig |
| Affiliation: | Centre de recherches mathématiques, Université de Montréal, Montréal 101, P.Q., Canada |
| Abstract: | The proof of the following theorem is given: A complete graph with n vertices can be decomposed into r regular bichromatic factors if and only if n is even and greater than 4 and there exists a natural number k with the properties that k ≤ r and 2k ? 1 < n ≤ 2k. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |