Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size

DOI10.1007/S00010-011-0098-6zbMath1233.05070OpenAlexW2039926741MaRDI QIDQ657830

Elizabeth J. Billington, Nicholas J. Cavenagh

Publication date: 10 January 2012

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-011-0098-6

zbMATH Keywords

graph decompositiontripartite graphcycle decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30)

Related Items (3)

Decomposition of complete Tripartite graphs into triangles and claws ⋮ Decomposition of complete tripartite graphs into cycles and paths of length three ⋮ Unnamed Item

Cites Work

• Further decompositions of complete tripartite graphs into 5-cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size