Cycle decompositions of complete graphs

DOI10.1016/0012-365X(82)90284-9zbMATH Open0476.05047MaRDI QIDQ1160189FDOQ1160189

Authors: E. J. Farrell 

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

circuit polynomialcircuit cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• New 5-designs
• Is there a (72,36) d = 16 self-dual code? (Corresp.)
• Title not available (Why is that?)
• 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
• Planes of order 10 do not have a collineation of order 5
• Self-dual codes over GF(4)
• Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
• The children of the (32, 16) doubly even codes
• Contractions of self-orthogonal codes
• Symmetry codes and their invariant subcodes

Cited In (1)

• A bibliography on chromatic polynomials

This page was built for publication: Cycle decompositions of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160189)