Cycles containing a set of elements in cubic graphs.
Sheng Bau · 1990
In this paper, obtain necessary and sufficient condition for 3-connected cubic graph to have a containing any set of nine vertices and an we also prove that in every 3-connected cubic planar any set of fourteen vertices and is contained in a cycle. As there is 3-connected cubic planar that of fifteen vertices and an not on any cycle, the result is the best possible.