The Enumeration of Non-Isomorphic 2-Connected Planar Maps

DOI10.4153/CJM-1983-023-5MaRDI QIDQ3669451zbMATH OpenFDO

Authors Valery A. Liskovets, Timothy R. S. Walsh

Publication date 1983

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1983-023-5

zbMATH Keywords

orientation-preserving isomorphismplanar maps

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cited in

(9)

• A survey of the asymptotic behaviour of maps
• Symmetries of unlabelled planar triangulations
• Counting unrooted loopless 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
• Automorphisms of maps with a given underlying graph and their application to enumeration
• Generating unlabeled connected cubic planar graphs uniformly at random
• Counting unrooted maps on the plane

This page was built for publication: The Enumeration of Non-Isomorphic 2-Connected Planar Maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3669451)