Pages that link to "Item:Q809409"
From MaRDI portal
The following pages link to A one-dimensional Whitney trick and Kuratowski's graph planarity criterion (Q809409):
Displaying 11 items.
- A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
- The van Kampen obstruction and its relatives (Q1048452) (← links)
- A deleted product criterion for approximability of maps by embeddings (Q1295255) (← links)
- Open problems on graphs arising from geometric topology (Q1295323) (← links)
- Van Kampen's embedding obstruction for discrete groups (Q1401448) (← links)
- On approximability by embeddings of cycles in the plane. (Q1409758) (← links)
- Homology classification of spatial embeddings of a graph (Q1902979) (← links)
- On the embeddability of skeleta of spheres (Q2655789) (← links)
- Crossing numbers and rotation numbers of cycles in a plane immersed graph (Q5050622) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- Planar diagrams for local invariants of graphs in surfaces (Q5220458) (← links)
