Fast generation of planar graphs

The program plantri is the fastest isomorph-free generator of many classes of planar graphs, including triangulations, quadrangulations, and convex polytopes. Many applications in the natural sciences as well as in mathematics have appeared. This paper describes plantri's principles of operation, the basis for its efficiency, and the recursive algorithms behind many of its capabilities. In addition, we give many counts of isomorphism classes of planar graphs compiled using plantri. These include triangulations, quadrangulations, convex polytopes, several classes of cubic and quartic graphs, and triangulations of disks.

[1]  V. Eberhard.  Zur Morphologie der Polyeder , 1891 .

[2]  W. T. Tutte,et al.  A Census of Planar Triangulations , 1962, Canadian Journal of Mathematics.

[3]  W. G. Brown,et al.  Enumeration of Quadrangular Dissections of the Disk , 1965, Canadian Journal of Mathematics.

[4]  R. Mullin,et al.  The enumeration of c-nets via quadrangulations , 1968 .

[5]  David W. Barnette.  On generating planar graphs , 1974, Discret. Math..

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

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

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

[9]  Michael B. Dillencourt,et al.  Polyhedra of Small Order and Their Hamiltonian Properties , 1996, J. Comb. Theory, Ser. B.

[10]  Andreas W. M. Dress,et al.  A Constructive Enumeration of Fullerenes , 1997, J. Algorithms.

[11]  Gunnar Brinkmann,et al.  Problems and scope of spiral algorithms and spiral codes for polyhedral cages , 1997 .

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

[13]  Gunnar Brinkmann,et al.  Isomorphism rejection in structure generation programs , 1998, Discrete Mathematical Chemistry.

[14]  Brendan D. McKay,et al.  Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs , 1999, Graphs Comb..

[15]  Brendan D. McKay,et al.  Nonhamiltonian 3-Connected Cubic Planar Graphs , 2000, SIAM J. Discret. Math..

[16]  Peter J. Cameron.  Sequences Realized by Oligomorphic Permutation Groups , 2000 .

[17]  Zigzags , 2001 .

[18]  Pierre Hansen,et al.  Distance Matrices, Wiener Indices, and Related Invariants of Fullerenes , 2001 .

[19]  Kymberly Dawn Riggins.  On Characterizing Graphs with Branchwidth at Most Four , 2001 .

[20]  P. Fowler,et al.  Cahn-Ingold-Prelog descriptors of absolute configuration for carbon cages. , 2001, Chemistry.

[21]  Nicholas C. Wormald,et al.  Counting 5‐connected planar triangulations , 2001, J. Graph Theory.

[22]  Michel Deza,et al.  4-valent plane graphs with 2-, 3- and 4-gonal faces , 2002 .

[23]  Edward A. Bender,et al.  The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..

[24]  N. Wormald,et al.  Enumeration of Rooted Cubic Planar Maps , 2002 .

[25]  B. McKay,et al.  Backtrack search and look-ahead for the construction of planar cubic graphs with restricted face sizes , 2003 .

[26]  Decomposing, Counting, and Generating Unlabeled Cubic Planar Graphs , 2003 .

[27]  Mathieu Dutour Sikiric,et al.  Zigzags, Railroads, and Knots in Fullerenes , 2004, J. Chem. Inf. Model..

[28]  Mathieu Dutour Sikiric,et al.  Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs , 2004, Electron. J. Comb..

[29]  Alexander Schwartz,et al.  Constructions of Cubical Polytopes , 2004 .

[30]  P. Kaski,et al.  Classification Algorithms for Codes and Designs , 2005 .

[31]  O. Delgado-Friedrichs,et al.  Isohedral simple tilings: binodal and by tiles with , 2005, Acta crystallographica. Section A, Foundations of crystallography.

[32]  Paul Wollan,et al.  Generation of simple quadrangulations of the sphere , 2005, Discret. Math..

[33]  Brendan D. McKay,et al.  To be or not to be Yutsis: Algorithms for the decision problem , 2005, Comput. Phys. Commun..

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

[35]  G. Royle.  Planar Triangulations with Real Chromatic Roots Arbitrarily Close to 4 , 2005, math/0511304.

[36]  Hai-Shun Wu,et al.  Structure and stability of neutral polyoxometalate cages: (Mo2O6)m (m=1–13) , 2006, Journal of molecular modeling.

[37]  Damian Heard,et al.  Computation of hyperbolic structures on 3-dimensional orbifolds , 2006 .

[38]  Alexander I. Suciu,et al.  Moment-angle Complexes, Monomial Ideals and Massey Products , 2005, math/0512497.