Decomposition of complete tripartite graphs into cycles and paths of length three

DOI10.11575/cdm.v15i3.62692zbMath1458.05218OpenAlexW3128823266MaRDI QIDQ5149422

Shanmugasundaram Priyadarsini, Appu Muthusamy

Publication date: 11 February 2021

Full work available at URL: https://dblp.uni-trier.de/db/journals/cdm/cdm15.html#PriyadarsiniM20

zbMATH Keywords

cyclepathcomplete tripartite graphdecomposition of graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition of complete bipartite graphs into paths and cycles
• Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Decomposing complete tripartite graphs into cycles of lengths 3 and 4
• Decomposing complete equipartite graphs into cycles of length2p

This page was built for publication: Decomposition of complete tripartite graphs into cycles and paths of length three