The following pages link to Blocks of Hypergraphs (Q3000508):
Displaying 10 items.
- Path-based supports for hypergraphs (Q450570) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
- Decomposing the feasibility of clustered spanning tree by paths (Q6558681) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)
- Hypergraph edge representations with the use of homological paths (Q6644071) (← links)
- On the cut-vertex and the interval transit functions of hypergraphs (Q6660055) (← links)
