GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING

DOI10.1142/S0218216504003421zbMath1066.57004OpenAlexW2005215089MaRDI QIDQ4659822

Jennifer Hespen, Katherine Sharrow, Eman Kunz, Anton Dochtermann, Stephan Chan, Joel Foisy, Quincy Loney, Trent Lalonde, Nathan Thomas

Publication date: 21 March 2005

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218216504003421

zbMATH Keywords

intrinsically linkedembedded graphminor minimaldisjoint linking propertyself linked

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (6)

Classifying intrinsically linked tournaments by score sequence ⋮ SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS ⋮ Intrinsically triple linked complete graphs ⋮ Intrinsic linking and knotting in tournaments ⋮ Intrinsically linked graphs and even linking number ⋮ Knots and links in spatial graphs: a survey

Cites Work

• Knots and links in spatial graphs
• INTRINSICALLY n-LINKED GRAPHS
• Linkless embeddings of graphs in 3-space

This page was built for publication: GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING