The Enumeration of Non-Isomorphic 2-Connected Planar Maps
From MaRDI portal
Publication:3669451
DOI10.4153/CJM-1983-023-5zbMath0519.05041MaRDI QIDQ3669451
Valery A. Liskovets, Timothy R. S. Walsh
Publication date: 1983
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
Counting unrooted maps on the plane ⋮ A reductive technique for enumerating non-isomorphic planar maps ⋮ Symmetries of unlabelled planar triangulations ⋮ Counting unrooted loopless planar maps ⋮ Enumeration of unrooted maps of a given genus ⋮ Efficient enumeration of sensed planar maps ⋮ Generating unlabeled connected cubic planar graphs uniformly at random ⋮ A survey of the asymptotic behaviour of maps ⋮ Automorphisms of maps with a given underlying graph and their application to enumeration
This page was built for publication: The Enumeration of Non-Isomorphic 2-Connected Planar Maps
