Some equitably 3-colourable cycle decompositions of complete equipartite graphs

DOI10.1016/j.disc.2005.03.021zbMath1073.05028OpenAlexW2057285092MaRDI QIDQ2566144

Mary Waterhouse, James G. Lefevre

Publication date: 22 September 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.03.021

zbMATH Keywords

graph colouring

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Some equitably 3-colorable cycle decompositions of \(K_v + 1\)

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• A new class of group divisible designs with block size three
• Balanced incomplete block designs and related designs
• Partial Steiner triple systems with equal-sized holes
• Further decompositions of complete tripartite graphs into 5-cycles
• Some equitably 3-colourable cycle decompositions
• Decompositions of complete multipartite graphs into cycles of even length
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item