A bijective census of nonseparable planar maps (Q1268599)

An embedding of a connected graph in the sphere is called a planar map if it partitions the sphere into simply connected regions. A nonseparable planar map is a planar map without cut vertices and loop edges. The paper considers bijections between nonseparable planar maps and different kinds of trees and derives enumerations and random generations.