Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)
The graph \(K^c_n\vee 2K_2\) is obtained from a set of \(n\) vertices and a graph \(2K_2\), by joining each of the \(n\) vertices to each vertex of \(2K_2\). In the paper a \(\rho\)-valuation of \(K^c_n\vee 2K_2\) is found. This result implies a number of graph decomposition results. For instance, it follows that every graph \(K_{8n+5}\) cyclically decomposes into edge-disjoint copies of \(K^c_n\vee 2K_2\).
scientific article; zbMATH DE number 932549