| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651949 | Electronic Notes in Discrete Mathematics | 2015 | 8 Pages |
Abstract
We derive a constructive decomposition of unlabelled triangulations by giving a full characterisation of their symmetries. This result will enable us to deduce a complete enumerative description of unlabelled cubic planar graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
