A polynomial-time algorithm to find a linkless embedding of a graph

DOI10.1016/j.jctb.2008.10.002zbMath1179.05110DBLPjournals/jct/Holst09OpenAlexW2122764799WikidataQ56431015 ScholiaQ56431015MaRDI QIDQ1003855

Hein van der Holst

Publication date: 4 March 2009

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.10.002

zbMATH Keywords

algorithmgraphspolynomial-timelinkless embedding3-space

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Bad drawings of small complete graphs ⋮ Linkless and flat embeddings in 3-space ⋮ On 2-cycles of graphs ⋮ An Algorithm for Detecting Intrinsically Knotted Graphs

Cites Work

• A one-dimensional Whitney trick and Kuratowski's graph planarity criterion
• Graph minors. XIII: The disjoint paths problem
• Kuratowski chains
• Sachs' linkless embedding conjecture
• A Polynomial Solution to the Undirected Two Paths Problem
• Homology of Deleted Products of One-Dimensional Spaces
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial-time algorithm to find a linkless embedding of a graph