Graph Matching

matching: no two edges are incident on the same vertices

complete matching: includes all vertices



maximal matching: greatest number of edges for given set of vertices


Return to CIS 350 Index Page