Generating all 3‐connected 4‐regular planar graphs from the octahedron graph
Hajo J. Broersma, A. J. W. Duijvestijn, Frits Göbel · Journal of Graph Theory · 1993
Abstract We prove that all 3‐connected 4‐regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a procedure by Lehel to generate all connected 4‐regular planar graphs from the Octahedron Graph. © 1993 John Wiley & Sons, Inc.