Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 932-934 |
Number of pages | 3 |
Journal | Information Processing Letters |
Volume | 109 |
Issue number | 16 |
DOIs | |
State | Published - Jul 31 2009 |
Bibliographical note
Funding 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: [email protected] (S. Cichacz), [email protected] (D. Froncek).
Keywords
- Factorization
- Graph algorithms
- Prism