Pages that link to "Item:Q2875647"
From MaRDI portal
The following pages link to The point-set embeddability problem for plane graphs (Q2875647):
Displaying 9 items.
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Universal point sets for planar three-trees (Q2253908) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- The point-set embeddability problem for plane graphs (Q2874563) (← links)
- Graphs embedded in the plane with a bounded number of accumulation points (Q4432772) (← links)
- Kinetic and Stationary Point-Set Embeddability for Plane Graphs (Q4912210) (← links)
- EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION (Q5297793) (← links)
- Planar embeddability of the vertices of a graph using a fixed point set is NP-hard (Q5301397) (← links)
- Graph Drawing (Q5896901) (← links)