The following pages link to Path-based supports for hypergraphs (Q450570):
Displaying 16 items.
- Multi-colored spanning graphs (Q784473) (← links)
- Using the metro-map metaphor for drawing hypergraphs (Q831834) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Short plane supports for spatial hypergraphs (Q1725733) (← links)
- Emergence and dynamics of short food supply chains (Q2031240) (← 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)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117) (← links)
- Short Plane Supports for Spatial Hypergraphs (Q5233132) (← links)
- On planar supports for hypergraphs (Q5891343) (← links)
- On Planar Supports for Hypergraphs (Q5900859) (← links)
- Decomposing the feasibility of clustered spanning tree by paths (Q6558681) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)
- Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)