Pages that link to "Item:Q3611876"
From MaRDI portal
The following pages link to Subdivision Drawings of Hypergraphs (Q3611876):
Displaying 20 items.
- Path-based supports for hypergraphs (Q450570) (← links)
- Trinque problem: covering complete graphs by plane degree-bounded hypergraphs (Q511700) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Using the metro-map metaphor for drawing hypergraphs (Q831834) (← links)
- Generating hinges from arbitrary subhypergraphs (Q1197992) (← links)
- Subdivisions in planar graphs (Q1366603) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- On transversal numbers of intersecting straight line systems and intersecting segment systems (Q2236577) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- (Q3773924) (← links)
- The Painter’s Problem: Covering a Grid with Colored Connected Polygons (Q4625138) (← links)
- CHROMATIC POLYNOMIAL OF SEMI-UNIFORM HYPERSTAR (Q4973449) (← links)
- On intersecting straight line systems (Q5043952) (← links)
- On transversal and 2-packing numbers in uniform linear systems (Q5154597) (← links)
- Decomposing the feasibility of clustered spanning tree by paths (Q6558681) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)