Cycles containing 12 vertices in 3-connected cubic graphs

A necessary and sufficient condition is obtained for a set of 12 vertices in any 3-connected cubic graph to lie on a common cycle.

[1]  S. Cobeljic,et al.  Computer investigation of cubic graphs , 1976 .

[2]  Mark N. Ellingham,et al.  Constructing certain cubic graphs , 1982 .

[3]  Gordon F. Royle,et al.  An 11-vertex theorem for 3-connected cubic graphs , 1988, J. Graph Theory.

[4]  Gordon F. Royle.  Constructive enumeration of graphs , 1988, Bulletin of the Australian Mathematical Society.