For each odd number n, we describe a regular projection of a planar graph such that every spatial graph obtained by giving it over/under information of crossing points contains a (2,n)-torus knot. We also show that for any spatial graph H, there is a regular projection of a (possibly nonplanar) graph such that every spatial graph obtained from it contains a subgraph that is ambient isotopic to H.
|Number of pages||7|
|Journal||Journal of Knot Theory and its Ramifications|
|Publication status||Published - 1996 Dec|
- Planar graph
- Regular projection
ASJC Scopus subject areas
- Algebra and Number Theory