5-cycle systems with holes

DOI10.1007/BF00130571zbMath0867.05016OpenAlexW2083871030MaRDI QIDQ677163

D. G. Hoffman, C. A. Rodger, Darryn E. Bryant

Publication date: 3 August 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00130571

zbMATH Keywords

hole5-cycle systemDoyen-Wilson problem

Mathematics Subject Classification ID

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

Related Items

Small embeddings for partial 5-cycle systems ⋮ 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\) ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) ⋮ Doyen-Wilson Results for Odd Length Cycle Systems ⋮ \((m,n)\)-cycle systems

Cites Work

• The Doyen-Wilson theorem extended to 5-cycles
• Embeddings of Steiner triple systems
• The chromatic index of complete multipartite graphs
• On the doyen‐wilson theorem for m‐cycle systems
• Unnamed Item
• Unnamed Item
• Unnamed Item