Forbidden subgraphs and the existence of a 2-walk

A k -walk of a graph is a spanning closed walk meeting each vertex at most k times. In this paper, we consider sets of forbidden subgraphs that imply the existence of a k -walk in a connected graph of sufficiently large order, and give a characterization of such sets for k = 2 .