Article contents
Decomposition of Kn into Dragons
Published online by Cambridge University Press: 20 November 2018
Abstract
It is shown that if 1<n ≡ 0 or 1 (mod 2 m), then the edges of Kn may be partitioned into isomorphic copies of a graph D3(m) and also of a graph D4(m), graphs consisting respectively of a triangle with an attached path of m - 3 edges or a quadrilateral with an attached path of m - 4 edges. If m is a power of 2 then the above condition is shown to be necessary and sufficient for the existence of such a partition.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1980
References
- 1
- Cited by