Counting unrooted planar maps

DOI10.1016/0012-365X(81)90238-7zbMath0467.05034OpenAlexW2047466759MaRDI QIDQ1155627

Nicholas C. Wormald

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90238-7

zbMATH Keywords

generating functionsnon-separable map

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (16)

Enumeration of \(r\)-regular maps on the torus. II: Unsensed maps ⋮ Counting unlabelled chord diagrams of maximal genus ⋮ Enumeration of regular maps on surfaces of a given genus ⋮ A reductive technique for enumerating non-isomorphic planar maps ⋮ Counting maps on doughnuts ⋮ Counting non-isomorphic three-connected planar maps ⋮ Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices ⋮ The Asymptotic Number of Convex Polyhedra ⋮ Enumeration of unsensed orientable and non-orientable maps ⋮ Enumeration of unrooted hypermaps of a given genus ⋮ Enumeration of maps regardless of genus: geometric approach ⋮ Enumeration of unrooted maps of a given genus ⋮ Efficient enumeration of sensed planar maps ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components ⋮ A survey of the asymptotic behaviour of maps ⋮ Enumeration of unrooted hypermaps

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• On the Tumber of Planar Maps
• Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
• A Census of Planar Maps
• Enumeration of Non-Separable Planar Maps

This page was built for publication: Counting unrooted planar maps