Hypergraph planarity and the complexity of drawing venn diagrams
David S. Johnson, H. O. Pollak · Journal of Graph Theory · 1987
Abstract We introduce two new notions of planarity for hypergraphs based on dual generalizations of the standard Venn diagram. These definitions are illustrated by results concerning the existence and nonexistence of such diagrams for certain classes of hypergraphs. We conclude by showing that the general problem of determining whether such diagrams exist is NP‐complete.