Pages that link to "Item:Q3800081"
From MaRDI portal
The following pages link to Hypergraph planarity and the complexity of drawing venn diagrams (Q3800081):
Displayed 11 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)
- 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)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- Representation of Planar Hypergraphs by Contacts of Triangles (Q5452217) (← links)