Pages that link to "Item:Q1693313"
From MaRDI portal
The following pages link to \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313):
Displaying 17 items.
- On embedding a cycle in a plane graph (Q1011765) (← links)
- Subexponential-time and FPT algorithms for embedded flat clustered planarity (Q1627160) (← links)
- On the planarity of cyclic graphs (Q1657785) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981) (← links)
- Embedding graphs into embedded graphs (Q2205635) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Bounded Embeddings of Graphs in the Plane (Q2819488) (← links)
- (Q2961507) (redirect page) (← links)
- Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs (Q3402368) (← links)
- (Q4206756) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Embedding Graphs into Embedded Graphs (Q5136253) (← links)
- Advances on Testing C-Planarity of Embedded Flat Clustered Graphs (Q5384459) (← links)
- Graph Drawing (Q5897617) (← links)