  A cycle in a graph is called dominating if every edge of the graph is
incident with a vertex of the cycle. In this paper, we investigate forbidden
pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.
