Journal of Graph Algorithms and Applications Listing All Plane Graphs

In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A "rooted" plane graph is a plane graph with one designated (directed) edge on the outer face. The algorithm uses O(m) space and generates such graphs in O(1) time per graph on average without duplications. The algorithm does not output the entire graph but the difference from the previous graph. By modifying the algorithm we can generate all connected (non-rooted) plane graphs with at most m edges in O(m3) time per graph.

[1]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations , 2005 .

[2]  Brendan D. McKay,et al.  Constant Time Generation of Free Trees , 1986, SIAM J. Comput..

[3]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[4]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[5]  Shin-Ichi Nakano,et al.  Efficient generation of triconnected plane triangulations , 2001, Comput. Geom..

[6]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[7]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[8]  A. Nijenhuis.  Combinatorial algorithms , 1975 .

[9]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[10]  Sandra Mitchell Hedetniemi,et al.  Constant Time Generation of Rooted Trees , 1980, SIAM J. Comput..

[11]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[12]  Shin-Ichi Nakano,et al.  Constant Time Generation of Trees with Specified Diameter , 2004, WG.

[13]  Marek Chrobak,et al.  Minimum-width grid drawings of plane graphs , 1998, Comput. Geom..

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

[15]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[16]  Shin-Ichi Nakano,et al.  Efficient Generation of Plane Triangulations without Repetitions , 2001, ICALP.

[17]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[18]  Leslie Ann Goldberg,et al.  Efficient algorithms for listing combinatorial structures , 1993 .