I want to check that a graph is factor-critical or not. I did not find any code to do that, except to remove an arbitrary vertex and find perfect matching.
Please help me if you have another way to check that.
The definition of a factor-critical graph is : https://en.wikipedia.org/wiki/Factor-critical_graph