Counting unrooted planar maps
From MaRDI portal
Publication:1155627
DOI10.1016/0012-365X(81)90238-7zbMath0467.05034MaRDI QIDQ1155627
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
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, Efficient enumeration of sensed planar maps, A reductive technique for enumerating non-isomorphic planar maps, Enumeration of unrooted maps of a given genus, Enumeration of unrooted hypermaps, The Asymptotic Number of Convex Polyhedra
Cites Work