Pages that link to "Item:Q5301378"
From MaRDI portal
The following pages link to Clustering Cycles into Cycles of Clusters (Q5301378):
Displayed 16 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← 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)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Bounded Embeddings of Graphs in the Plane (Q2819488) (← links)
- Towards the Hanani-Tutte Theorem for Clustered Graphs (Q2945188) (← links)
- Clustered Planarity: Clusters with Few Outgoing Edges (Q3611843) (← links)
- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters (Q3611846) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- Crossing minimization in perturbed drawings (Q5896138) (← links)
- Crossing minimization in perturbed drawings (Q5915943) (← links)
