Counting unrooted planar maps
From MaRDI portal
Cites work
- A Census of Planar Maps
- Chromatic Sums for Rooted Planar Triangulations: The Cases λ = 1 and λ = 2
- Enumeration of Non-Separable Planar Maps
- scientific article; zbMATH DE number 3752877 (Why is no real title available?)
- scientific article; zbMATH DE number 3407696 (Why is no real title available?)
- On the Tumber of Planar Maps
- Parallel concepts in graph theory
Cited in
(17)- Structure and enumeration of two-connected graphs with prescribed three-connected components
- A survey of the asymptotic behaviour of maps
- Counting non-isomorphic three-connected planar maps
- Enumeration of \(r\)-regular maps on the torus. II: Unsensed maps
- Enumeration of regular maps on surfaces of a given genus
- Efficient enumeration of sensed planar maps
- A reductive technique for enumerating non-isomorphic planar maps
- Enumeration of unsensed orientable and non-orientable maps
- Enumeration of unrooted maps of a given genus
- Counting unlabelled chord diagrams of maximal genus
- Enumeration of unrooted hypermaps
- Counting maps on doughnuts
- The Asymptotic Number of Convex Polyhedra
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
- Generating plane quadrangulations and symmetry-preserving operations on maps
- Enumeration of unrooted hypermaps of a given genus
- Enumeration of maps regardless of genus: geometric approach
This page was built for publication: Counting unrooted planar maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155627)
