On the doyen‐wilson theorem for m‐cycle systems
From MaRDI portal
Publication:4764659
DOI10.1002/JCD.3180020405zbMath0818.05028OpenAlexW2093505088MaRDI QIDQ4764659
C. A. Rodger, Darryn E. Bryant
Publication date: 3 August 1995
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.3180020405
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
Small embeddings for partial 5-cycle systems ⋮ The Doyen-Wilson theorem extended to 5-cycles ⋮ Decomposition of complete multigraphs into crown graphs ⋮ On m-cycle holey systems ⋮ Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ The Doyen--Wilson theorem for kite systems ⋮ 5-cycle systems with holes ⋮ Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ Doyen-Wilson Results for Odd Length Cycle Systems ⋮ The Doyen-Wilson theorem for 3-sun systems ⋮ 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
Cites Work
This page was built for publication: On the doyen‐wilson theorem for m‐cycle systems
