Advanced search
Add to list

Fast generation of planar graphs

Author
Organization
Abstract
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.
Keywords
ENUMERATION, ALGORITHMS, FULLERENES, CONSTRUCTION

Citation

Please use this url to cite or link to this publication:

MLA
Brinkmann, Gunnar, and Brendan D. McKay. “Fast Generation of Planar Graphs.” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, edited by G Brinkmann and PW Fowler, vol. 58, no. 2, 2007, pp. 323–57.
APA
Brinkmann, G., & McKay, B. D. (2007). Fast generation of planar graphs. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 58(2), 323–357.
Chicago author-date
Brinkmann, Gunnar, and Brendan D McKay. 2007. “Fast Generation of Planar Graphs.” Edited by G Brinkmann and PW Fowler. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 58 (2): 323–57.
Chicago author-date (all authors)
Brinkmann, Gunnar, and Brendan D McKay. 2007. “Fast Generation of Planar Graphs.” Ed by. G Brinkmann and PW Fowler. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY 58 (2): 323–357.
Vancouver
1.
Brinkmann G, McKay BD. Fast generation of planar graphs. Brinkmann G, Fowler P, editors. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY. 2007;58(2):323–57.
IEEE
[1]
G. Brinkmann and B. D. McKay, “Fast generation of planar graphs,” MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, vol. 58, no. 2, pp. 323–357, 2007.
@article{397541,
  abstract     = {{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.}},
  author       = {{Brinkmann, Gunnar and McKay, Brendan D}},
  editor       = {{Brinkmann, G and Fowler, PW}},
  issn         = {{0340-6253}},
  journal      = {{MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY}},
  keywords     = {{ENUMERATION,ALGORITHMS,FULLERENES,CONSTRUCTION}},
  language     = {{eng}},
  location     = {{Ghent, Belgium}},
  number       = {{2}},
  pages        = {{323--357}},
  title        = {{Fast generation of planar graphs}},
  volume       = {{58}},
  year         = {{2007}},
}

Web of Science
Times cited: