A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
The complete bipartite graph \(k_{1,m}\), \(m\geq 1\), is called a star. In this note it is shown, for \(n\geq 4\), that the minimum number of star- subgraphs which partition the edges of \(k_{2n-1,2n-1}\) or \(k_{2n,2n}\) is \(n+2\).
scientific article; zbMATH DE number 3959479
scientific article