The following pages link to (Q3839007):
Displaying 15 items.
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- How to draw the minimum cuts of a planar graph (Q1882854) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Completely connected clustered graphs (Q2458931) (← links)
- Straight-Line Rectangular Drawings of Clustered Graphs (Q3183438) (← 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)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)