Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081): Difference between revisions
From MaRDI portal
Created claim: DBLP publication ID (P1635): journals/jgt/JohnsonP87, #quickstatements; #temporary_batch_1731462974821 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.3190110306 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.3190110306 / rank | |||
Normal rank | |||
Latest revision as of 18:50, 21 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hypergraph planarity and the complexity of drawing venn diagrams |
scientific article |
Statements
Hypergraph planarity and the complexity of drawing venn diagrams (English)
0 references
1987
0 references
vertex-planar hypergraph
0 references
hyperedge-planar hypergraph
0 references
