Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.3190110306
@@ Property / DOI: 10.1002/jgt.3190110306 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q56171393
@@ Property / Wikidata QID: Q56171393 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jgt/JohnsonP87
@@ Property / DBLP publication ID: journals/jgt/JohnsonP87 / rank @@
+Normal rank
@@ Property / DOI @@
+.1002/JGT.3190110306
@@ Property / DOI: 10.1002/JGT.3190110306 / rank @@
+Normal rank