An Algorithm for Detecting Intrinsically Knotted Graphs

DOI10.1080/10586458.2014.852033zbMath1291.57005arXiv1109.1030OpenAlexW2003088690MaRDI QIDQ5418071

Jonathan Miller, Ramin Naimi

Publication date: 26 May 2014

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.1030

zbMATH Keywords

linking numberArf invariantspatial graphintrinsically knotted

Mathematics Subject Classification ID

Related Items (4)

Linearly free graphs ⋮ Complete minors in complements of nonseparating planar graphs ⋮ Many, many more intrinsically knotted graphs ⋮ Order nine MMIK graphs

Cites Work

• Graph minors. XX: Wagner's conjecture
• A polynomial-time algorithm to find a linkless embedding of a graph
• Graph minors. XIII: The disjoint paths problem
• Sachs' linkless embedding conjecture
• Knots and links in spatial graphs
• Intrinsically knotted graphs
• A newly recognized intrinsically knotted graph
• Realization of knots and links in a spatial graph

This page was built for publication: An Algorithm for Detecting Intrinsically Knotted Graphs