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

Hein van der Holst. A polynomial-time algorithm to find a linkless embedding of a graph. Journal of Combinatorial Theory, Series A, 99(2):512-530, 2009. [doi]

Authors

Hein van der Holst

This author has not been identified. Look up 'Hein van der Holst' in Google