Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Florek, Jan
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910915039854592
author Florek, Jan
author_facet Florek, Jan
contents Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not Kempe equivalent to any other colouring. Mohar (1985 and 1987) characterized and enumerated akempic triangulations with all vertices of degree $3$ or $6$. We give a new characterization of the akempic triangulations and a new proof of the Mohar enumeration theorem.
format Preprint
id arxiv_https___arxiv_org_abs_2504_13316
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
Florek, Jan
Combinatorics
05C15, 05C30, 05C75, 11B57
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not Kempe equivalent to any other colouring. Mohar (1985 and 1987) characterized and enumerated akempic triangulations with all vertices of degree $3$ or $6$. We give a new characterization of the akempic triangulations and a new proof of the Mohar enumeration theorem.
title Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
topic Combinatorics
05C15, 05C30, 05C75, 11B57
url https://arxiv.org/abs/2504.13316