On graphical partitions and planarity

AbstractChvátal gave a necessary condition for a partition to have a planar realization. It is of interest to find: (i) partitions which satisfy the condition of the theorem but have no planar realization, and also (ii) partitions which satisfy the condition and have only planar realizations. We give a list of all such partitions with 6, 7, 8 and 9 elements. We also give an algorithm for generating all graphs with a given partition, an algorithm for generating all subcompositions of a given composition and some general classes of partitions which have planar realizations only and some which have non-planar realizations only