Pages that link to "Item:Q1003855"
From MaRDI portal
The following pages link to A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855):
Displaying 6 items.
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a ring (Q1045935) (← links)
- A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring (Q1928513) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- An Algorithm for Detecting Intrinsically Knotted Graphs (Q5418071) (← links)
- On 2-cycles of graphs (Q6170796) (← links)