Hypergraph planarity and the complexity of drawing venn diagrams

DOI10.1002/jgt.3190110306zbMath0654.05055OpenAlexW2153718046WikidataQ56171393 ScholiaQ56171393MaRDI QIDQ3800081

H. O. Pollak, David S. Johnson

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110306

zbMATH Keywords

hyperedge-planar hypergraphvertex-planar hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (19)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs ⋮ How to draw a hypergraph ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Path-based supports for hypergraphs ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ Short plane supports for spatial hypergraphs ⋮ Path-Based Supports for Hypergraphs ⋮ Blocks of Hypergraphs ⋮ The minimum feasible tileset problem ⋮ Trinque problem: covering complete graphs by plane degree-bounded hypergraphs ⋮ Overlaying a hypergraph with a graph with bounded maximum degree ⋮ Subdivision Drawings of Hypergraphs ⋮ Representation of Planar Hypergraphs by Contacts of Triangles ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Equivalences in Euler-based diagram systems through normal forms ⋮ Short Plane Supports for Spatial Hypergraphs ⋮ Multi-colored spanning graphs

Cites Work

• On the Desirability of Acyclic Database Schemes
• Efficient Planarity Testing
• Unnamed Item

This page was built for publication: Hypergraph planarity and the complexity of drawing venn diagrams