Enumeration of labelled 4-regular planar graphs

From MaRDI portal
Publication:5237371

DOI10.1112/PLMS.12234zbMATH Open1422.05053arXiv1709.04678OpenAlexW3104343140WikidataQ128417576 ScholiaQ128417576MaRDI QIDQ5237371FDOQ5237371


Authors: Marc Noy, Clément Requilé, Juanjo Rué Edit this on Wikidata


Publication date: 17 October 2019

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Abstract: We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be computed effectively as the solution of a system of equations, from which the coefficients can be extracted. As a byproduct, we also enumerate labelled 3-connected 4-regular planar graphs, and simple 4-regular rooted maps.


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




Recommendations





Cited In (8)





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237371)