Abstract
In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r, and (3) every 4-regular bipartite graph decomposes into paths P4.
Original language | English |
---|---|
Pages (from-to) | 17-27 |
Number of pages | 11 |
Journal | Discrete Mathematics |
Volume | 89 |
Issue number | 1 |
DOIs | |
State | Published - May 3 1991 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics