Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)

DOI10.1016/S0012-365X(96)00072-6zbMath0884.05068MaRDI QIDQ1363688

Erin R. Spicer, C. A. Rodger, Darryn E. Bryant

Publication date: 8 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

embedding\(m\)-cycle system

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) 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, Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths, Decomposing various graphs into short even-length cycles, GENERALISATIONS OF THE DOYEN–WILSON THEOREM, Common multiples of complete graphs and a 4-cycle, Packings and coverings of various complete graphs with the 4-cycle with a pendant edge, \(d\)-cube decompositions of \(K_n\setminus K_m\), Enclosings of \(\lambda \)-fold 4-cycle systems, Doyen-Wilson Results for Odd Length Cycle Systems, Six-cycle systems, \((m,n)\)-cycle systems, 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)

Cites Work

• 5-cycle systems with holes
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• 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
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Chromatic Numbers for Certain Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item