Decompositions of complete graphs into blown-up cycles \(C_m\)[2]

DOI10.1016/j.disc.2009.10.018zbMath1230.05234OpenAlexW1983229775MaRDI QIDQ966036

Petr Kovář, Dalibor Fronček, Michael Kubesa

Publication date: 27 April 2010

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

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

zbMATH Keywords

graph labelinggraph decompositions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Sunlet decomposition of certain equipartite graphs ⋮ Decomposition of complete bipartite graphs into generalized prisms

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Edge partitions of complete multipartite graphs into equal length circuits
• Factorizations of product graphs into cycles of uniform length
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decompositions of complete multipartite graphs into cycles of even length
• Cycle decompositions III: Complete graphs and fixed length cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions of complete graphs into blown-up cycles \(C_m\)[2]