Cyclically near‐resolvable 4‐cycle systems of 2Kv
DOI10.1002/JCD.21669zbMATH Open1427.05178OpenAlexW2965829882WikidataQ127411286 ScholiaQ127411286MaRDI QIDQ5204971FDOQ5204971
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
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 2Kv
- 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
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)
Cited In (5)
- A complete solution to the existence problem for cyclically 2-resolvable 4-cycle systems of the complete multipartite graph
- Almost resolvable k‐cycle systems with
- 1‐rotationally resolvable 4‐cycle systems of 2Kv
- 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)\)
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)
