# How many maximal planar graphs are there?

We denote by a triangulation a (simple) maximal planar graph. How many triangulations on $$n$$ vertices are there? How many triangulations are there if we cannot distinguish the vertices, i.e. isomorphic triangulations are seen as equal?

All results I can find are for plane graphs, i.e. concrete embeddings, and not abstract graphs.

• I might be mistaken here but i thought maximal planar graphs have unique embeddings, so counting (non isomorphic) plane triangulations should be the same? – daniello Dec 1 '20 at 7:13
• This question may be more suitable for math.stackexchange. – Kai Dec 4 '20 at 2:40