In this paper we discuss old and new theoretical methods for computing the number of graphs with a given partition. We also show how a judicious combination of these methods gives rise to a procedure that is sufficiently powerful to make possible the enumeration of all graphs on 10 points according to their partitions.
|Number of pages||14|
|Journal||Journal of Graph Theory|
|Publication status||Published - 1981|