| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657164 | Journal of Combinatorial Theory, Series B | 2009 | 19 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
