Pages that link to "Item:Q3800081"
From MaRDI portal
The following pages link to Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081):
Displaying 19 items.
- Path-based supports for hypergraphs (Q450570) (← links)
- Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Short plane supports for spatial hypergraphs (Q1725733) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- Equivalences in Euler-based diagram systems through normal forms (Q2827282) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- How to draw a hypergraph (Q3477978) (← links)
- Subdivision Drawings of Hypergraphs (Q3611876) (← links)
- Short Plane Supports for Spatial Hypergraphs (Q5233132) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
