Let q(G) denote the minimum integer t for which E(G) can be partition
ed into t induced matchings of G. Faudree et al. conjectured that q(G
) less-than-or-equal-to d2, if G is a bipartite graph and d is the max
imum degree of G. In this note, we give an affirmative answer for d =
3, the first nontrivial case of this conjecture.