Linkless embedding
Top View
- Arxiv:Math.GT/0604045 V1 3 Apr 2006
- Excluded-Minor Characterization of Apex-Outerplanar Graphs" (2011)
- MAXIMALLY KNOTLESS GRAPHS a Thesis Presented to the Faculty Of
- When Is a Graph Knotted?
- Non-Separating Planar Graphs
- Forbidden Minors: Finding the Finite Few
- Linkless and Flat Embeddings in 3-Space in Quadratic Time
- Combinatorial Restrictions on Cell Complexes
- The Extremal Function and Colin De Verdi`Ere Graph Parameter
- Problems on Low-Dimensional Topology, 2012
- Graph Planarity and Related Topics
- Graph Minors
- 12 Graph Minors
- What Is...A Graph Minor, Volume 53, Number 3
- Algorithmic Graph Structure Theory
- Intrinsic Linking and Knotting of Graphs Kenji Kozai Harvey Mudd College
- GRAPH MINOR THEORY 1. Introduction Let Us Start with Recalling Kuratowski's Theorem
- International Workshop of Knots and Links in a Spatial Graph Program and Abstracts