Factor-critical property in 3-dominating-critical graphs (Q1011779)

A graph \(G\) is \(\gamma\)-\textit{vertex-critical} if \(\gamma(G - v) < \gamma(G)\) for each vertex \(v \in G\), where \(\gamma(G)\) is the dominating number of \(G\). It is shown that if \(G\) is a \(2\)-connected \(K_{1,5}\)-free \(3\)-vertex critical graph of odd order, then \(G - v\) has a perfect matching for any vertex \(v \in G\), except for two graphs of order \(11\) and size \(24\). This proves a conjecture of \textit{N. Ananchuen} and \textit{M. D. Plummer} in [Discrete Math. 307, No.\,13, 1651--1658 (2007; Zbl 1133.05073)].