Enumeration of labelled 4-regular planar graphs
From MaRDI portal
Publication:5237371
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.
Recommendations
Cited in
(8)- Enumeration of rooted 3-connected bipartite planar maps
- Enumeration of labeled 4-regular planar graphs
- Enumeration of labelled 4-regular planar graphs. II: Asymptotics
- Random cubic planar maps
- On the expected number of perfect matchings in cubic planar graphs
- ASYMPTOTIC NUMBERS OF GENERAL 4-REGULAR GRAPHS WITH GIVEN CONNECTIVITIES
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
- Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
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)