Matching and Factor-Critical Property in 3-Dominating-Critical Graphs

Tao Wang, Qinglin Yu

Let $\gamma (G)$ be the domination number of a graph $G$. A graph $G$ is \emph{domination-vertex-critical}, or \emph{$\gamma$-vertex-critical}, if $\gamma (G-v)<\gamma (G)$ for every vertex $v\in V(G)$…