Counting non-isomorphic three-connected planar maps

A counting formula for the number of non-isomorphic planar maps with m edges was obtained by V. A. Liskovets, and non-isomorphic 2-connected planar maps were counted by Liskovets and the author. R. W. Robinson's generalization of Polya's counting theory can be applied to these formulae to count, in polynomial time, non-isomorphic planar maps satisfying various sets of restrictions. Here two sets of planar maps are counted: maps with given 2-connected components, and 3-connected maps.