References
- J. [Conway and Gordon 83] Conway and C. Gordon. “Knots and Links in Spatial Graphs.” J. Graph Theory 7 (1983), 445–453.
- J. [Foisy 02] Foisy. “Intrinsically Knotted Graphs.” J. Graph Theory 39 (2002), 178–187.
- J. [Foisy 03] Foisy. “A Newly Recognized Intrinsically Knotted Graph.” J. Graph Theory 43 (2003), 199–209.
- N. [Goldberg et al. 14] Goldberg, T. W. Mattman, and R. Naimi. “Many, Many More Intrinsically Knotted Graphs.” To appear in Algebraic and Geometric Topology, 2014.
- N. [Goldberg et al. 11] Goldberg, T. W. Mattman, and R. Naimi. “Many, Many More Intrinsically Knotted Graphs: Appendix.” arXiv:1109.1632. Available online (http://faculty.oxy. edu/rnaimi/CV/publications/many-appendix/), 2011.
- T. [Kohara and Suzuki 92] Kohara and S. Suzuki. “Some Remarks on Knots and Links in Spatial Graphs.” In Knots 90 (Osaka, 1990), pp. 435–445. De Gruyter, 1992.
- N. [Robertson and Seymour 95] Robertson and P. Seymour. “Graph Minors XIII. The Disjoint Paths Problem.” J. Comb. Theory Ser. B 63 (1995), 65–110.
- N. [Robertson and Seymour 04] Robertson and P. Seymour. “Graph Minors XX.Wagner's Conjecture.” J. Combin. Theory Ser. B 92 (2004), 325–357.
- N. [Robertson et al. 95] Robertson, P. Seymour, and R. Thomas. “Sachs’ Linkless Embedding Conjecture.” J. Combin. Theory Ser. B 64 (1995), 185–227.
- K. [Taniyama and Yasuhara 01] Taniyama and A. Yasuhara. “Realization of Knots and Links in a Spatial Graph.” Topology and Its Applications 112 (2001), 87–109.
- H. [Van der Holst 09] Van der Holst. “A Polynomial-Time Algorithm to Find a Linkless Embedding of a Graph.” J. Combinatorial Theory, Series B 99 (2009), 512–530.