Editing Linkless embedding (section)

==References==
{{refbegin|2}}
*{{citation
 | last = Böhme | first = Thomas
 | contribution = On spatial representations of graphs
 | editor-last = Bodendieck | editor-first = Rainer
 | isbn = 978-3-411-14301-6
 | location = Mannheim
 | pages = 151–167
 | publisher = Bibliographisches Institut, Wissenschaftsverlag
 | title = Contemporary Methods in Graph Theory: In honor of Prof. Dr. Klaus Wagner
 | year = 1990}}. As cited by {{harvtxt|Robertson|Seymour|Thomas|1993a}}.
*{{citation
 | last = Bothe | first = H.-G.
 | id = New Scottish Book, Problem 876, 20.5.1972
 | journal = Colloquium Mathematicum
 | page = 163
 | title = Problem P855
 | volume = 28
 | year = 1973}}. As cited by {{harvtxt|Sachs|1983}}.
*{{citation
 | last1 = Bowlin | first1 = Garry
 | last2 = Foisy | first2 = Joel
 | doi = 10.1142/S0218216504003652
 | issue = 8
 | journal = Journal of Knot Theory and Its Ramifications
 | pages = 1021–1028
 | title = Some new intrinsically 3-linked graphs
 | volume = 13
 | year = 2004| url = https://zenodo.org/record/894516
 }}.
*{{citation
 | last1 = Conway | first1 = John H. | author1-link = John Horton Conway
 | last2 = Gordon | first2 = Cameron McA. | author2-link = Cameron Gordon (mathematician)
 | doi = 10.1002/jgt.3190070410
 | issue = 4
 | journal = [[Journal of Graph Theory]]
 | pages = 445–453
 | title = Knots and links in spatial graphs
 | volume = 7
 | year = 1983}}.
*{{citation
 | last1 = Fellows | first1 = Michael R. | author1-link = Michael Fellows
 | last2 = Langston | first2 = Michael A. | author2-link = Michael Langston
 | doi = 10.1145/44483.44491
 | issue = 3
 | journal = [[Journal of the ACM]]
 | pages = 727–739
 | title = Nonconstructive tools for proving polynomial-time decidability
 | volume = 35
 | year = 1988| doi-access = free
 }}.
*{{citation
 | last1 = Flapan | first1 = Erica | author1-link = Erica Flapan
 | last2 = Howards | first2 = Hugh
 | last3 = Lawrence | first3 = Don
 | last4 = Mellor | first4 = Blake
 | doi = 10.2140/agt.2006.6.1025
 | journal = [[Algebraic & Geometric Topology]]
 | pages = 1025–1035
 | title = Intrinsic linking and knotting of graphs in arbitrary 3–manifolds
 | volume = 6
 | year = 2006
 | issue = 3 | arxiv = math/0508004}}.
*{{citation
 | last1 = Flapan | first1 = Erica | author1-link = Erica Flapan
 | last2 = Naimi | first2 = Ramin
 | last3 = Pommersheim | first3 = James
 | doi = 10.1016/S0166-8641(00)00064-X
 | issue = 2
 | journal = [[Topology and Its Applications]]
 | pages = 239–246
 | title = Intrinsically triple linked complete graphs
 | url = http://pages.pomona.edu/~elf04747/Research/I3L.pdf
 | volume = 115
 | year = 2001| doi-access = free
 }}.
*{{citation
 | last1 = Flapan | first1 = Erica | author1-link = Erica Flapan
 | last2 = Pommersheim | first2 = James
 | last3 = Foisy | first3 = Joel
 | last4 = Naimi | first4 = Ramin
 | doi = 10.1142/S0218216501001360
 | issue = 8
 | journal = [[Journal of Knot Theory and Its Ramifications]]
 | pages = 1143–1154
 | title = Intrinsically n-linked graphs
 | volume = 10
 | year = 2001}}.
*{{citation
 | last1 = Fleming | first1 = Thomas
 | last2 = Diesl | first2 = Alexander
 | journal = [[Algebraic & Geometric Topology]]
 | pages = 1419–1432
 | title = Intrinsically linked graphs and even linking number
 | volume = 5
 | year = 2005
 | issue = 4
 | arxiv = math/0511133
 | doi = 10.2140/agt.2005.5.1419}}.
*{{citation
 | last = Foisy | first = Joel
 | doi = 10.1002/jgt.10017
 | issue = 3
 | journal = [[Journal of Graph Theory]]
 | pages = 178–187
 | title = Intrinsically knotted graphs
 | volume = 39
 | year = 2002}}.
*{{citation
 | last = Foisy | first = Joel
 | doi = 10.1002/jgt.10114
 | issue = 3
 | journal = [[Journal of Graph Theory]]
 | pages = 199–209
 | title = A newly recognized intrinsically knotted graph
 | volume = 43
 | year = 2003}}.
*{{citation
 | last1 = Hass | first1 = Joel | author1-link = Joel Hass
 | last2 = Lagarias | first2 = Jeffrey C. | author2-link = Jeffrey Lagarias
 | last3 = Pippenger | first3 = Nicholas | author3-link = Nick Pippenger
 | doi = 10.1145/301970.301971
 | issue = 2
 | journal = [[Journal of the ACM]]
 | pages = 185–211
 | title = The computational complexity of knot and link problems
 | volume = 46
 | year = 1999
 | arxiv = math/9807016}}.
*{{citation
 | last = van der Holst | first = Hein
 | doi = 10.1016/j.jctb.2008.10.002
 | issue = 2
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | pages = 512–530
 | title = A polynomial-time algorithm to find a linkless embedding of a graph
 | volume = 99
 | year = 2009| doi-access = 
 }}.
*{{citation
 | last1 = Kawarabayashi | first1 = Ken-ichi | authorlink = Ken-ichi Kawarabayashi
 | last2 = Kreutzer | first2 = Stephan
 | last3 = Mohar | first3 = Bojan | author3-link = Bojan Mohar
 | contribution = Linkless and flat embeddings in 3-space and the unknot problem
 | doi = 10.1145/1810959.1810975
 | pages = 97–106
 | title = Proc. ACM Symposium on Computational Geometry (SoCG '10)
 | year = 2010| isbn = 978-1-4503-0016-2 }}.
*{{citation
 | last1 = Lovász | first1 = László | author1-link = László Lovász
 | last2 = Schrijver | first2 = Alexander | author2-link = Alexander Schrijver
 | doi = 10.1090/S0002-9939-98-04244-0
 | issue = 5
 | journal = [[Proceedings of the American Mathematical Society]]
 | pages = 1275–1285
 | title = A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
 | volume = 126
 | year = 1998| doi-access = free
 }}.
*{{citation
 | last = Mader | first = W.
 | doi = 10.1007/BF01350657
 | issue = 2
 | journal = [[Mathematische Annalen]]
 | pages = 154–168
 | title = Homomorphiesätze für Graphen
 | volume = 178
 | year = 1968}}.
*{{citation
 | last1 = Motwani | first1 = Rajeev | author1-link = Rajeev Motwani
 | last2 = Raghunathan | first2 = Arvind 
 | last3 = Saran | first3 = Huzur
 | contribution = Constructive results from graph minors: linkless embeddings
 | doi = 10.1109/SFCS.1988.21956
 | pages = 398–409
 | title = Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS '88)
 | year = 1988| isbn = 0-8186-0877-3 }}.
*{{citation
 |last1        = Nešetřil
 |first1       = Jaroslav
 |author1-link = Jaroslav Nešetřil
 |last2        = Thomas
 |first2       = Robin
 |author2-link = Robin Thomas (mathematician)
 |issue        = 4
 |journal      = Commentationes Mathematicae Universitatis Carolinae
 |pages        = 655–659
 |title        = A note on spatial representation of graphs
 |url          = http://dspace.dml.cz/handle/10338.dmlcz/106404
 |volume       = 26
 |year         = 1985
 |url-status      = dead
 |archiveurl   = https://web.archive.org/web/20110718171201/http://dspace.dml.cz/handle/10338.dmlcz/106404
 |archivedate  = 2011-07-18
}}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | doi = 10.1006/jctb.1995.1006
 | issue = 1
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | pages = 65–110
 | title = Graph Minors. XIII. The disjoint paths problem
 | volume = 63
 | year = 1995| doi-access = free
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | last3 = Thomas | first3 = Robin | author3-link = Robin Thomas (mathematician)
 | contribution = A survey of linkless embeddings
 | editor1-last = Robertson | editor1-first = Neil | editor1-link = Neil Robertson (mathematician)
 | editor2-last = Seymour | editor2-first = Paul | editor2-link = Paul Seymour (mathematician)
 | pages = 125–136
 | publisher = American Mathematical Society
 | series = Contemporary Mathematics
 | title = Graph Structure Theory: Proc. AMS–IMS–SIAM Joint Summer Research Conference on Graph Minors
 | url = http://people.math.gatech.edu/~thomas/PAP/linklsurvey.pdf
 | volume = 147
 | year = 1993a}}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = P. D. | author2-link = Paul Seymour (mathematician)
 | last3 = Thomas | first3 = Robin | author3-link = Robin Thomas (mathematician)
 | doi = 10.1090/S0273-0979-1993-00335-5
 | issue = 1
 | journal = [[Bulletin of the American Mathematical Society]]
 | pages = 84–89
 | title = Linkless embeddings of graphs in 3-space
 | volume = 28
 | year = 1993b
 | arxiv = math/9301216
 | mr = 1164063}}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = P. D. | author2-link = Paul Seymour (mathematician)
 | last3 = Thomas | first3 = Robin | author3-link = Robin Thomas (mathematician)
 | doi = 10.1006/jctb.1995.1032
 | issue = 2
 | journal = [[Journal of Combinatorial Theory, Series B]]
 | pages = 185–227
 | title = Sachs' linkless embedding conjecture
 | volume = 64
 | year = 1995| doi-access = free
 }}.
*{{citation
 | last1 = Robertson | first1 = Neil | author1-link = Neil Robertson (mathematician)
 | last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
 | last3 = Thomas | first3 = Robin | author3-link = Robin Thomas (mathematician)
 | doi = 10.1007/BF01202354
 | issue = 3
 | journal = [[Combinatorica]]
 | pages = 279–361
 | title = Hadwiger's conjecture for ''K''<sub>6</sub>-free graphs
 | url = http://people.math.gatech.edu/~thomas/PAP/hadwiger.pdf
 | volume = 13
 | year = 1993c}}.
*{{citation
 | last = Sachs | first = Horst | author-link = Horst Sachs
 | contribution = On a spatial analogue of Kuratowski's Theorem on planar graphs – an open problem
 | doi = 10.1007/BFb0071633
 | editor1-last = Horowiecki | editor1-first = M.
 | editor2-last = Kennedy | editor2-first = J. W.
 | editor3-last = Sysło | editor3-first = M. M.
 | pages = 230–241
 | publisher = Springer-Verlag
 | series = Lecture Notes in Mathematics
 | title = Graph Theory: Proceedings of a Conference held in Łagów, Poland, February 10–13, 1981
 | volume = 1018
 | isbn = 978-3-540-12687-4 | year = 1983}}.
*{{citation
 | last = Saran | first = Huzur
 | publisher = University of California, Berkeley
 | series = Ph.D. thesis
 | title = Constructive Results in Graph Minors: Linkless Embeddings
 | year = 1989}}.
*{{citation
 | last = Truemper | first = Klaus
 | pages = 100–101
 | publisher = Academic Press
 | title = Matroid Decomposition
 | url = http://www.utdallas.edu/~klaus/Mbook/matroiddecompositionbook.pdf
 | year = 1992}}.
{{refend}}