Hypergraph planarity and the complexity of drawing venn diagrams
- 1 September 1987
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 11 (3) , 309-325
- https://doi.org/10.1002/jgt.3190110306
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Construction of Venn DiagramsThe College Mathematics Journal, 1984
- An algorithm for constructing edge‐trees from hypergraphsNetworks, 1983
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- ON PROPERTIES OF A WELL‐KNOWN GRAPH OR WHAT IS YOUR RAMSEY NUMBER?Annals of the New York Academy of Sciences, 1979
- Evidence for Parity Nonconservation in the Decays of the Narrow States near 1.87 GeV/Physical Review Letters, 1976
- Hypermaps versus bipartite mapsJournal of Combinatorial Theory, Series B, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- On the Fundamental Problem of MathematicsThe American Mathematical Monthly, 1972
- And What Is Your Erdos Number?The American Mathematical Monthly, 1969
- I. On the diagrammatic and mechanical representation of propositions and reasoningsJournal of Computers in Education, 1880