Abstract
Let K m, n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A K p, q -factorization of K m, n is a set of edge-disjoint K p, q -factors of K m, n which partition the set of edges of K m, n . Martin (Discrete Math. 167/168 (1997) 461) gave simple necessary conditions for K p, q -factorization of K m, n , and conjectured these conditions are sufficient. In this paper, it is shown that Martin's conjecture on K p, q -factorization of K m, n is true for p: q=2:3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
