Cycle decompositions of complete graphs
From MaRDI portal
Publication:1160189
DOI10.1016/0012-365X(82)90284-9zbMath0476.05047MaRDI QIDQ1160189
Publication date: 1982
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Planes of order 10 do not have a collineation of order 5
- Symmetry codes and their invariant subcodes
- Contractions of self-orthogonal codes
- Self-dual codes over GF(4)
- A classification of self-orthogonal codes over GF(2)
- Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
- The children of the (32, 16) doubly even codes
- Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
- New 5-designs
- Is there a (72,36) d = 16 self-dual code? (Corresp.)
This page was built for publication: Cycle decompositions of complete graphs
