The enumeration of c-nets via quadrangulations

From MaRDI portal
Revision as of 03:44, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5575349

DOI10.1016/S0021-9800(68)80007-9zbMath0183.52403MaRDI QIDQ5575349

Ronald C. Mullin, Paul J. Schellenberg

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)




Related Items (37)

Generating labeled planar graphs uniformly at randomEnumeration of 2-connected loopless 4-regular maps on the planeOn polynomials counting essentially irreducible mapsThe maximum degree of random planar graphsFace sizes of 3-polytopesThe asymptotic enumeration of rooted convex polyhedraBisingular maps on the torusEnumerative properties of rooted circuit mapsImproved enumeration of simple topological graphsEnumeration of corner polyhedra and 3-connected Schnyder labelingsCounting 2-connected 4-regular maps on the projective planeEnumeration of labeled 4-regular planar graphsCounting rooted 4-regular unicursal planar mapsRandom cubic planar graphs converge to the Brownian sphereOn random planar graphs, the number of planar graphs and their triangulationsA note on coloured quadrangulationsAsymptotic enumeration and limit laws for graphs of fixed genusLocal convergence of random planar graphsEnumeration of labelled 4-regular planar graphs. II: AsymptoticsCounting rooted unicursal planar mapsThe number of polyhedral (3-connected planar) graphs4-edge-connected 4-regular maps on the projective planeCounting 5-connected planar triangulationsSuccinct representations of planar mapsThe number of rooted nearly cubic \(c\)-netsEnumerating near-4-regular maps on the sphere and the torusDegree distribution in random planar graphsEfficient enumeration of sensed planar mapsUniform random sampling of planar graphs in linear timeAsymptotic enumeration and limit laws of planar graphsDistributions of near-4-regular maps on the sphere and the projective planeTransportation networks: Old and newOn the number of rooted c-nets4-regular maps on the Klein bottleThe number of loopless \(4\)-regular maps on the projective planeA survey of the asymptotic behaviour of mapsGeneration of simple quadrangulations of the sphere




This page was built for publication: The enumeration of c-nets via quadrangulations