On the number of rooted c-nets

DOI10.1016/0095-8956(84)90018-2zbMath0538.05042OpenAlexW2057706068MaRDI QIDQ793049

Yanpei Liu

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90018-2

zbMATH Keywords

rooted c-netslinear recursionsrooted 3-connected maps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (9)

The enumeration of rooted cubic c-nets ⋮ Counting rooted 4-regular unicursal planar maps ⋮ Counting rooted unicursal planar maps ⋮ The number of polyhedral (3-connected planar) graphs ⋮ The number of rooted nearly cubic \(c\)-nets ⋮ Enumerating near-4-regular maps on the sphere and the torus ⋮ Transportation networks: Old and new ⋮ 4-regular maps on the Klein bottle ⋮ The number of loopless \(4\)-regular maps on the projective plane

Cites Work

• The enumeration of c-nets via quadrangulations
• A Census of Planar Maps

This page was built for publication: On the number of rooted c-nets