Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56171393, #quickstatements; #temporary_batch_1712190744730 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Desirability of Acyclic Database Schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Revision as of 17:50, 18 June 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
