Characterizing factor critical graphs and an algorithm.
Dingjun Lou, Dongning Rao · 2004
In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary and sufficient condition, we develop a linear time algorithm to determine whether a graph is factor critical if one of its maximum matchings is given.