Characterisation of symmetries of unlabelled triangulations

DOI10.1016/j.endm.2015.06.080zbMath1346.05123OpenAlexW2204894707MaRDI QIDQ322330

Mihyun Kang, Philipp Sprüssel

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.080

zbMATH Keywords

triangulationsgraph automorphismsenumerative combinatorics

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Enumeration and asymptotic properties of unlabeled outerplanar graphs
• A complete grammar for decomposing a family of graphs into 3-connected components
• On the enumeration of convex polyhedra
• On random planar graphs, the number of planar graphs and their triangulations
• Random planar graphs
• The number of labeled 2-connected planar graphs
• Almost all maps are asymmetric
• Asymptotic enumeration and limit laws of planar graphs
• Asymptotic Study of Subcritical Graph Classes
• Random cubic planar graphs
• A Census of Planar Maps

This page was built for publication: Characterisation of symmetries of unlabelled triangulations