Title of article
A polynomial-time algorithm to find a linkless embedding of a graph
Author/Authors
van der Holst، نويسنده , , Hein، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
19
From page
512
To page
530
Abstract
A Z -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 Z -linkless embedding of a graph provided the graph has one and to test whether an embedding of a graph is Z -linkless or not.
Keywords
linkless embedding , graphs , 3-space , Polynomial-time , algorithm
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2009
Journal title
Journal of Combinatorial Theory Series B
Record number
1528849
Link To Document