Perfect Bc-Matchings

     Curtis Barefoot
Department of Mathematics, Computer Science Department
New Mexico Tech,
Socorro, New Mexico 87801

                                                                     Abstract

A perfect bc-matching of graph G is a factor of G in which every component is a single edge or an odd cycle. We will show that G has a perfect bc-matching if and only if

^{for every}

where ob(G - S) is the number of bipartite components in G - S of odd order.