The structure of 4-γγ-critical graphs with a cut vertex

Let γ(G)γ(G) denote the minimum cardinality of a dominating set for GG. A graph GG is said to be kk-γγ-critical if γ(G)=kγ(G)=k, but γ(G+e)