A note on dominating cycles in 2-connected graphs Original Research Article

Let G be a 2-connected graph on n vertices such that d(x) + d(y) + d(z) ⩾ n for all triples of independent vertices x, y, z. We prove that every longest cycle in G is a dominating cycle unless G is a spanning subgraph of a graph belonging to one of four easily specified classes of graphs.