Linkless and flat embeddings in 3-space and the unknot problem

DOI10.1145/1810959.1810975zbMath1284.05174OpenAlexW1994909432WikidataQ29031732 ScholiaQ29031732MaRDI QIDQ5405867

Stephan Kreutzer, Ken-ichi Kawarabayashi, Bojan Mohar

Publication date: 3 April 2014

Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1810959.1810975

zbMATH Keywords

knotunknotflat embeddinglinkless embedding

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Graph Minors and Parameterized Algorithm Design, Combing a Linkage in an Annulus, Linkless and flat embeddings in 3-space