| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512122 | Discrete Mathematics | 2005 | 22 Pages |
Abstract
We also give a theoretical enumeration of rooted planar quadrangulations of minimum degree 3, and some counts obtained by a program of Brinkmann and McKay that implements our algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gunnar Brinkmann, Sam Greenberg, Catherine Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan,