Characterisation of symmetries of unlabelled triangulations

M. Kang; P. Sprüssel

doi:10.1016/j.endm.2015.06.080

Characterisation of symmetries of unlabelled triangulations

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	587-594
Number of pages	8
Journal	Electronic Notes in Discrete Mathematics
Volume	49
DOIs	https://doi.org/10.1016/j.endm.2015.06.080
Publication status	Published - Nov 2015

Keywords

Enumerative combinatorics
Graph automorphisms
Triangulations

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.endm.2015.06.080

Cite this

@article{6d6e8f54fa474c50a808bc47c6c568d6,

title = "Characterisation of symmetries of unlabelled triangulations",

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.",

keywords = "Enumerative combinatorics, Graph automorphisms, Triangulations",

author = "M. Kang and P. Spr{\"u}ssel",

year = "2015",

month = nov,

doi = "10.1016/j.endm.2015.06.080",

language = "English",

volume = "49",

pages = "587--594",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Characterisation of symmetries of unlabelled triangulations

AU - Kang, M.

AU - Sprüssel, P.

PY - 2015/11

Y1 - 2015/11

N2 - 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.

AB - 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.

KW - Enumerative combinatorics

KW - Graph automorphisms

KW - Triangulations

UR - http://www.scopus.com/inward/record.url?scp=84947789844&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2015.06.080

DO - 10.1016/j.endm.2015.06.080

M3 - Article

AN - SCOPUS:84947789844

SN - 1571-0653

VL - 49

SP - 587

EP - 594

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Characterisation of symmetries of unlabelled triangulations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this