Pages that link to "Item:Q2458931"
From MaRDI portal
The following pages link to Completely connected clustered graphs (Q2458931):
Displaying 14 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)
- Convex drawings of hierarchical planar graphs and clustered planar graphs (Q988690) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← 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)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902519) (← links)