The following pages link to Planarity for clustered graphs (Q6102302):
Displayed 21 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
- How to draw a clustered tree (Q1044037) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- How to draw the minimum cuts of a planar graph (Q1882854) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Completely connected clustered graphs (Q2458931) (← links)
- Towards the Hanani-Tutte Theorem for Clustered Graphs (Q2945188) (← links)
- Clustered Planarity: Clusters with Few Outgoing Edges (Q3611843) (← links)
- Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Q3611846) (← links)
- Non-crossing Paths with Geographic Constraints (Q4625135) (← links)
- Crossing minimization in perturbed drawings (Q5915943) (← links)