Recent examples in the theory of partition graphs

  • DeTemple D
  • Dineen M
  • Robertson J
 et al. 
  • 5


    Mendeley users who have this article in their library.
  • 10


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • D. W. DeTemple

  • M. J. Dineen

  • J. M. Robertson

  • K. L. McAvaney

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free