Decomposing the complete graph into cycles of many lengths |
| |
| Authors: | Darryn E. Bryant Peter Adams |
| |
| Affiliation: | (1) Centre for Combinatorics, Department of Mathematics, The University of Queensland, 4072 Queensland, Australia |
| |
| Abstract: | For all oddv  3 the complete graph onvKv vertices can be decomposed intov – 2 edge disjoint cycles whose lengths are 3, 3, 4, 5,...,v – 1. Also, for all oddv 7,Kv can be decomposed intov – 3 edge disjoint cycles whose lengths are 3, 4,...,v – 4,v – 2,v – 1,v.Research supported by Australian Research Council grant A49130102 |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
