Cycles through \(k+2\) vertices in \(k\)-connected graphs (Q792340)

A set \(S\) of vertices of a graph \(G\) is said to be cocyclic if some elementary circuit in \(G\) passes through all the vertices in \(S\). The reviewer and \textit{D. M. Mesner} [Can. J. Math. 19, 1319--1328 (1967; Zbl 0205.285)] characterized those \(k\)-connected graphs containing a \((k+1)\) set of vertices which is not cocyclic. The present paper announces a result that goes one step further: A characterization of the \(k\)-connected graphs in which every \((k+1)\)-set is cocyclic but some \((k+2)\)-set is not cocyclic. Proofs are to appear elsewhere.