We establish a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn, n into some families of 3-regular graphs.
Bibliographical noteFunding Information:
✩ The work was supported by Fulbright Scholarship nr 15072441. * Corresponding author at: AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland. E-mail addresses: firstname.lastname@example.org (S. Cichacz), email@example.com (D. Froncek).
- Graph algorithms