Pages that link to "Item:Q5405867"
From MaRDI portal
The following pages link to Linkless and flat embeddings in 3-space and the unknot problem (Q5405867):
Displaying 8 items.
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
- Detecting unknotted graphs in 3-space (Q1179973) (← links)
- Three-page embeddings of singular knots (Q2486685) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- NONTRIVIAL EMBEDDINGS OF POLYGONAL INTERVALS AND UNKNOTS IN 3-SPACE (Q4236653) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- Computing paths of large rank in planar frameworks deterministically (Q6668350) (← links)