Forbidden pairs and the existence of a dominating cycle

Abstract

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.

19 pages, 11 figures

Cited by in corpus (1)

• Dominating cycles and forbidden pairs containing a path of order 5