Pages that link to "Item:Q420569"
From MaRDI portal
The following pages link to Linkless and flat embeddings in 3-space (Q420569):
Displaying 5 items.
- A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
- Primitive spatial graphs and graph minors (Q2471413) (← links)
- Linkless and flat embeddings in 3-space and the unknot problem (Q5405867) (← links)
- On the number of edges in maximally linkless graphs (Q6056749) (← links)
- A more accurate view of the flat wall theorem (Q6606321) (← links)