Simultaneous intersection representation of pairs of graphs

We characterize the pairs (G₁, G₂) of graphs on a shared vertex set that are intersection polysemic: those for which the vertices may be assigned subsets of a universal set such that G₁ is the intersection graph of the subsets and G₂ is the intersection graph of their complements. We also consider several special cases and explore bounds on the size of the universal set. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 171–190, 1999