Decomposition of complete multigraphs into crown graphs

DOI10.1007/S12190-009-0267-0zbMath1227.05193OpenAlexW1992187990MaRDI QIDQ2380876

Jinping Guo, Zhi-He Liang

Publication date: 12 April 2010

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-009-0267-0

zbMATH Keywords

graph designcrown graph\(HGDIGD\)

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51)

Related Items (6)

Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ On the existence of 5-Sun systems ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Unnamed Item ⋮ A reduction of the spectrum problem for odd sun systems and the prime case ⋮ On the existence of \(k\)-sun systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 5-cycle systems with holes
• Decomposition of complete multigraphs into stars
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• The Doyen-Wilson theorem extended to 5-cycles
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• Balanced incomplete block designs with block size 9. II.
• Balanced incomplete block designs with block size 9 and \(\lambda=2,4,8\)
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Embeddings of Steiner triple systems
• Balanced incomplete block designs with block size 8
• Cycle decompositions III: Complete graphs and fixed length cycles
• On sequential labelings of graphs
• Bipartite designs
• On the doyen‐wilson theorem for m‐cycle systems

This page was built for publication: Decomposition of complete multigraphs into crown graphs