Pages that link to "Item:Q1923513"
From MaRDI portal
The following pages link to A reductive technique for enumerating non-isomorphic planar maps (Q1923513):
Displaying 13 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 \(r\)-regular maps on the torus. II: Unsensed maps (Q1625823) (← links)
- Efficient enumeration of sensed planar maps (Q1779505) (← links)
- Enumeration of unsensed orientable and non-orientable maps (Q1987089) (← links)
- Enumeration of unrooted maps of a given genus (Q2498741) (← links)
- Automorphisms of maps with a given underlying graph and their application to enumeration (Q2581145) (← links)
- Counting unlabelled chord diagrams of maximal genus (Q2632548) (← links)
- Enumeration of unrooted hypermaps (Q3439586) (← links)
- Topological enumeration of complex polynomial vector fields (Q5262266) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- Enumeration of unsensed orientable and non-orientable maps (Q6621235) (← links)
