Decomposition of complete graphs into small generalized prisms (Q2443423)

The authors study necessary and sufficient conditions for a complete graph of order \(n\) to be edge-decomposable into copies of a given graph \(H\). They focus on graphs \(H\) that are obtained from the prism over a cycle by altering some of the matching edges. For two specific types of such graphs, which arise from prisms over cycles of length \(12\) and \(16\), they provide a full characterization of the orders of complete graphs that can be edge-decomposed.