The Enumeration of Non-Isomorphic 2-Connected Planar Maps

DOI10.4153/CJM-1983-023-5zbMATH Open0519.05041MaRDI QIDQ3669451FDOQ3669451

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

Publication date: 1983

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

zbMATH Keywords

planar mapsorientation-preserving isomorphism

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
• Automorphisms of maps with a given underlying graph and their application to enumeration
• Efficient enumeration of sensed planar maps
• A reductive technique for enumerating non-isomorphic planar maps
• Counting unrooted loopless planar maps
• Counting unrooted maps on the plane
• Generating unlabeled connected cubic planar graphs uniformly at random
• Symmetries of unlabelled planar triangulations
• Enumeration of unrooted maps of a given genus

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)