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

H. Holst, van der

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
1 Downloads (Pure)

Abstract

A -linkless embedding of a graph is an embedding in 3-space such that each pair of disjoint circuits has zero linking number. In this paper we present polynomial-time algorithms to compute a -linkless embedding of a graph provided the graph has one and to test whether an embedding of a graph is -linkless or not.
Original languageEnglish
Pages (from-to)512-530
JournalJournal of Combinatorial Theory, Series B
Volume99
Issue number2
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'A polynomial-time algorithm to find a linkless embedding of a graph'. Together they form a unique fingerprint.

Cite this