Factor-critical graph

Factor-critical graph --- фактор-критический граф.

A graph [math]\displaystyle{ G = (V,E) }[/math] is factor-critical if [math]\displaystyle{ G - v }[/math] has a perfect matching for every vertex [math]\displaystyle{ v \in V(G) }[/math].