An 11‐vertex theorem for 3‐connected cubic graphs
Robert E. L. Aldred, BauSheng, Derek Holton, Gordon Royle · Journal of Graph Theory · 1988
Abstract In this paper we determine the circumstances under which a set of 11 vertices in a 3‐connected cubic graph lies on a cycle. In addition, we consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.