Agraph is bicritical if the removal of any pair of vertices decreases the domination number.We study the properties of bicritical graphs and their relation with critical graphs, and we obtain results for bicritical graphs with edge connectivity two or three. We also generalize the notion of the coalescence of two graphs and investigate the bicriticality of such graphs.
