1 paper
Jing Guo, Hailun Wu, Heping Zhang
A graph G with four or more vertices is called bicritical if the removal of any pair of distinct vertices of G results in a graph with a perfect matching. A bicritical graph is…