Pages that link to "Item:Q4607974"
From MaRDI portal
The following pages link to Embeddability in $\mathbb{R}^3$ is NP-hard (Q4607974):
Displaying 6 items.
- Invariants of graph drawings in the plane (Q778122) (← links)
- New constructions related to the polynomial sphere recognition problem (Q2136838) (← links)
- The unbearable hardness of unknotting (Q2656151) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- (Q5088981) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)
