The following pages link to How to draw a hypergraph (Q3477978):
Displaying 9 items.
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- Subdivision Drawings of Hypergraphs (Q3611876) (← links)
- The Painter’s Problem: Covering a Grid with Colored Connected Polygons (Q4625138) (← links)
- Algorithms for the Hypergraph and the Minor Crossing Number Problems (Q5387756) (← links)
- How to Burn a Graph (Q5856432) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)