Pages that link to "Item:Q1011765"
From MaRDI portal
The following pages link to On embedding a cycle in a plane graph (Q1011765):
Displaying 20 items.
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- A new perspective on clustered planarity as a combinatorial embedding problem (Q897898) (← links)
- Recognizing weakly simple polygons (Q1688854) (← links)
- \(c\)-planarity of embedded cyclic \(c\)-graphs (Q1693313) (← links)
- Clustered planarity = flat clustered planarity (Q1725728) (← links)
- Stability of intersections of graphs in the plane and the van Kampen obstruction (Q1744614) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Embedding graphs into embedded graphs (Q2205635) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Clustered planarity with pipes (Q2414866) (← links)
- Bounded Embeddings of Graphs in the Plane (Q2819488) (← links)
- Reconstruction of Weakly Simple Polygons from Their Edges (Q3177902) (← links)
- Beyond Clustered Planar Graphs (Q5001664) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- Hanani-Tutte for approximating maps of graphs (Q5115807) (← links)
- Embedding Graphs into Embedded Graphs (Q5136253) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Crossing minimization in perturbed drawings (Q5896138) (← links)
- Crossing minimization in perturbed drawings (Q5915943) (← links)
