On diagonal cycle systems

MaRDI QIDQ2760444zbMATH OpenFDO

Authors Andrew Blinco

Publication date 2 January 2002

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\( D_{2n} \)-designdecompositions of complete graphsdiagonal cycle

Mathematics Subject Classification ID

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

Recommendations

• Diagonally switchable 4-cycle systems
• scientific article; zbMATH DE number 5174848
• On the construction of odd cycle systems
• Resolvable coverings of 2-paths by cycles
• Dihedral Hamiltonian cycle systems of the cocktail party graph

Cited in

(7)

• Decomposition of K_v into some graph with six vertices and seven edges
• Graph designs for all graphs with six vertices and eight edges
• Diagonally switchable \(\lambda \)-fold 4-cycle systems, \(\lambda >1\).
• A survey on the existence ofG-Designs
• Diagonally switchable 4-cycle systems revisited
• On the metamorphosis of a \(G\)-design into a (\(G-e\))-design
• Diagonally switchable 4-cycle systems

This page was built for publication: On diagonal cycle systems

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