  We give a full characterisation of the symmetries of unlabelled
triangulations and derive a constructive decomposition of unlabelled
triangulations depending on their symmetries. As an application of these
results we can deduce a complete enumerative description of unlabelled cubic
planar graphs.
