\(W_ v\) cycles in plane graphs
Given a plane graph \(G\), a \(W_v\) cycle is a cycle which intersects each face of \(G\) in a connected subgraph. If the minimum degree of \(G\) is at least 3 then a \(W_v\) cycle exists and its length is at most the number of faces in \(G\). Extremal classes of graphs are studied.
scientific article; zbMATH DE number 806237