Cyclically near‐resolvable 4‐cycle systems of 2Kv

DOI10.1002/JCD.21669MaRDI QIDQ5204971zbMATHOpenAlexWikidataFDO

Authors K. Matsubara, Sanpei Kageyama

Publication date 10 December 2019

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.21669

zbMATH Keywords

Skolem sequence4-cycle systemdisjoint difference familycyclically near-resolvable

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Doubly resolvable 4-cycle systems of \(2K_v\)
• Almost resolvable k‐cycle systems with
• Almost resolvable 4-cycle systems
• 1‐rotationally resolvable 4‐cycle systems of 2K_v
• scientific article; zbMATH DE number 26325
• Embeddings of resolvable 4-cycle systems
• On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
• \(\alpha\)-resolvable cycle systems for cycle length 4
• Doubly near resolvable \(m\)-cycle systems
• Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles

Cited in

(5)

• A complete solution to the existence problem for cyclically 2-resolvable 4-cycle systems of the complete multipartite graph
• On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
• 4-cycle systems of \(K_n-E(F^\ast)\)
• Almost resolvable k‐cycle systems with
• 1‐rotationally resolvable 4‐cycle systems of 2K_v

This page was built for publication: Cyclically near‐resolvable 4‐cycle systems of 2Kv

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