The following pages link to Counting unrooted planar maps (Q1155627):
Displayed 16 items.
- Counting maps on doughnuts (Q391387) (← links)
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices (Q442387) (← links)
- Enumeration of unrooted hypermaps of a given genus (Q960963) (← links)
- Enumeration of maps regardless of genus: geometric approach (Q966017) (← links)
- Structure and enumeration of two-connected graphs with prescribed three-connected components (Q1023394) (← links)
- A survey of the asymptotic behaviour of maps (Q1057284) (← links)
- Counting non-isomorphic three-connected planar maps (Q1144046) (← links)
- Enumeration of \(r\)-regular maps on the torus. II: Unsensed maps (Q1625823) (← links)
- Enumeration of regular maps on surfaces of a given genus (Q1661498) (← links)
- Efficient enumeration of sensed planar maps (Q1779505) (← links)
- A reductive technique for enumerating non-isomorphic planar maps (Q1923513) (← links)
- Enumeration of unsensed orientable and non-orientable maps (Q1987089) (← links)
- Enumeration of unrooted maps of a given genus (Q2498741) (← links)
- Counting unlabelled chord diagrams of maximal genus (Q2632548) (← links)
- Enumeration of unrooted hypermaps (Q3439586) (← links)
- The Asymptotic Number of Convex Polyhedra (Q3960868) (← links)