Symmetries of unlabelled planar triangulations
type: Item
instance of: scholarly article
title: Symmetries of unlabelled planar triangulations
zbMATH Open document ID: 1380.05037
author: Mihyun Kang
author: Philipp Sprüssel
published in: The Electronic Journal of Combinatorics
publication date: 2018-02-22T00:00:00Z
full work available at URL: v25i1p34
review text: Summary: We derive a decomposition scheme of unlabelled triangulations rooted at a single cell, where the decomposition depends on whether the automorphism group of the triangulation contains reflections, rotations, or both. Furthermore, the decomposition scheme is constructive in the sense that for each of the three cases, there is a \(k\in\mathbb{N}\) such that the scheme defines a one-to-\(k\) correspondence between the respective triangulations and their decompositions.
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 57M15
zbMATH DE Number: 6841878
zbMATH Keywords: triangulations
zbMATH Keywords: automorphisms
zbMATH Keywords: constructive decompositions
describes a project that uses: plantri
describes a project that uses: Library of Triangulations
MaRDI profile type: Publication
cites work: Some families of increasing planar maps
cites work: Decomposition and Enumeration of Triangulated Surfaces
cites work: Uniform infinite planar triangulations
cites work: Random Discrete Morse Theory and a New Library of Triangulations
cites work: Intervals in Catalan lattices and realizers of triangulations
cites work: Boltzmann Samplers, Pólya Theory, and Cycle Pointing
cites work: Generating labeled planar graphs uniformly at random
cites work: Counting colored random triangulations
cites work: Q3855356
cites work: A complete grammar for decomposing a family of graphs into 3-connected components
cites work: Boltzmann Samplers for the Random Generation of Combinatorial Structures
cites work: On the number of planar orientations with prescribed degrees
cites work: A calculus for the random generation of labelled combinatorial structures
cites work: Q5447147
cites work: Counting unrooted maps using tree-decomposition
cites work: Q3154383
cites work: Enumerative formulae for unrooted planar maps: a pattern
cites work: Triangulations. Structures for algorithms and applications
cites work: Automorphismen von polyedrischen Graphen
cites work: Isomorph-Free Exhaustive Generation
cites work: The Brownian map is the scaling limit of uniform random plane quadrangulations
cites work: Triangular Dissections of N-Gons
cites work: On random planar graphs, the number of planar graphs and their triangulations
cites work: Topological characteristics of random triangulated surfaces
cites work: Almost all maps are asymmetric
cites work: Enumeration of non-separable graphs
cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry
cites work: Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
cites work: A Census of Planar Triangulations
cites work: A Census of Planar Maps
cites work: On the enumeration of convex polyhedra
cites work: Q3216652
cites work: Counting non-isomorphic three-connected planar maps
cites work: Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
cites work: The Enumeration of Non-Isomorphic 2-Connected Planar Maps
description: scientific article; zbMATH DE number 6841878