Enumeration of labelled 4-regular planar graphs. II: Asymptotics

DOI10.1016/j.ejc.2022.103661OpenAlexW4311988199MaRDI QIDQ2700972

Clément Requilé, Marc Noy, Juanjo Rué

Publication date: 27 April 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.05943

zbMATH Keywords

asymptotic estimatesexponential generating function

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Random cubic planar maps ⋮ Enumeration of rooted 3-connected bipartite planar maps

Cites Work

• Unnamed Item
• Unnamed Item
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• The number of graphs not containing \(K_{3,3}\) as a minor
• The number of labeled 2-connected planar graphs
• Universal singular exponents in catalytic variable equations
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Enumeration and limit laws for series-parallel graphs
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Modern Computer Algebra
• Asymptotic enumeration and limit laws of planar graphs
• Asymptotic Study of Subcritical Graph Classes
• Random cubic planar graphs
• Further results on random cubic planar graphs
• Enumeration of labelled 4‐regular planar graphs
• The enumeration of c-nets via quadrangulations

This page was built for publication: Enumeration of labelled 4-regular planar graphs. II: Asymptotics