Hasheminezhad, Mahdieh; McKay, Brendan; Reeves, Tristan
We describe how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an amalgam of theory and computation. By incorporating the recursion into the canonical construc- tion path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtained with time complexity O(n2) per isomorphism class. A similar result is obtained for simple planar...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.