A vertex is an unmatched vertex in a matching if no edge of is incident to it. It is also called free or exposed, always relative to the specified matching in a graph: changing can change which vertices are free. The endpoints of an augmenting path in a matching must be distinct unmatched vertices in a matching before the change.
Articles by others on the same topic
There are currently no matching articles.