A partition graph is an intersection graph for a collection of subsets of auniversal set S with the property that every maximal independent set of vertices corresponds to a partition of S. Two questions which arose in the study of partition graphs are answered by recently discovered examples. An enumeration of the partition graphs on ten or fewer vertices is provided. © 1993.
DeTemple, D. W., Dineen, M. J., Robertson, J. M., & McAvaney, K. L. (1993). Recent examples in the theory of partition graphs. Discrete Mathematics, 113(1–3), 255–258. https://doi.org/10.1016/0012-365X(93)90520-4