论文信息 - Recursive generation of simple planar 5-regular graphs and pentangulations

Recursive generation of simple planar 5-regular graphs and pentangulations

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 construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtained with time complexity O(n 2 ) per isomorphism class. A similar result is obtained for simple planar pentangulations with minimum degree 2.

[1] William T. Tutte,et al. A theory of 3-connected graphs , 1961 .

[2] John E. Hopcroft,et al. Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[3] J. W. Butler. A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs , 1974, Canadian Journal of Mathematics.

[4] Max Fontet. A Linear Algorithm for Testing Isomorphism of Planar Graphs , 1976, ICALP.

[5] Jenö Lehel,et al. Generating all 4-regular planar graphs from the graph of the octahedron , 1981, J. Graph Theory.

[6] V. Batagelj. An improved inductive definition of two restricted classes of triangulations of the plane , 1989 .

[7] F. Göbel,et al. Generating all 3-connected 4-regular planar graphs from the octahedron graph , 1993, J. Graph Theory.

[8] Brendan D. McKay,et al. Isomorph-Free Exhaustive Generation , 1998, J. Algorithms.

[9] Brendan D. McKay,et al. Construction of planar triangulations with minimum degree 5 , 2005, Discret. Math..

[10] B. McKay,et al. Fast generation of planar graphs , 2007 .

[11] Brendan D. McKay,et al. A universal set of growth operations for fullerenes , 2008 .

[12] Brendan D. McKay,et al. Recursive Generation of 5-Regular Planar Graphs , 2009, WALCOM.