matching. So equivalently, a factor-critical graph is a graph in which there are near-perfect matchings that avoid every possible vertex.

Definition and characterizations

Factor-critical graphs may be characterized in several different ways, other than their definition as graphs in which each vertex deletion allows for a perfect matching:
*Tibor Gallai proved that a graph is factor-critical if and only if it is connected and, for each node

1.Previous
3.Next