 Factor-critical graph

A *factor-critical graph* is a type of graph in which the removal of any single vertex results in a graph that has a perfect matching. In other words, a graph \( G \) is called factor-critical if for every vertex \( v \) in \( G \), the graph \( G - v \) (the graph obtained by removing vertex \( v \) and its incident edges) has a perfect matching.