Enumeration of labeled 4-regular planar graphs

In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic notes in discrete mathematics Ročník 61; s. 933 - 939
Hlavní autoři: Noy, Marc, Requilé, Clément, Rué, Juanjo
Médium: Journal Article Publikace
Jazyk:angličtina
Vydáno: Elsevier B.V 01.08.2017
Témata:
05 Combinatorics
05C Graph theory
Classificació AMS
generating functions
graph enumeration
Matemàtiques i estadística
planar graphs
Àrees temàtiques de la UPC
generating functions
planar graphs
graph enumeration
ISSN:1571-0653, 1571-0653
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic calculus. As a by-product, we can also compute the algebraic generating function counting labeled 3-connected 4-regular planar maps.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2017.07.056