P\({}_ 3\)-factorization of complete multipartite graphs (Q920114): Difference between revisions

Let G and H be graphs. A spanning subgraph F of G is called an H-factor if and only if each component of F is isomorphic to H. If G is expressible as an edge-disjoint sum of H-factors then this sum is called an H-factorization of G. Let \(P_ 3\) be a path of order three and let K(m,n) be a complete multipartite graph with m partite set of n vertices each (m\(\geq 2,n\geq 1)\). The authors prove the following result. K(m,n) has a \(P_ 3\)- factorization if and only if (i) mn\(\equiv 0(mod 3)\) and (ii) (m- 1)n\(\equiv 0(mod 4)\).