"Hypergraph planarity and the complexity of drawing venn diagrams."

David S. Johnson, Henry O. Pollak (1987)

> Home

Details and statistics

DOI: 10.1002/JGT.3190110306

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/JohnsonP87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/JohnsonP87
David S. Johnson, Henry O. Pollak:
Hypergraph planarity and the complexity of drawing venn diagrams. J. Graph Theory 11(3): 309-325 (1987)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.