摘要
Let G= (V,E)be a simple graph, to V is the vertex set and E the edge set. Let F be a subset of edges. If F covers all the vertices of G and any two edges in F have no common end vertex, then F is called a factor or a perfect matching of G. Obviously, if G has a factor, then the number of its vertices, |V|, must be even.
