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

Authors:
Hein van der Holst
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 5
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Kuratowski chains

Journal of Combinatorial Theory Series B
Sachs' linkless embedding conjecture

Journal of Combinatorial Theory Series B
A Polynomial Solution to the Undirected Two Paths Problem

Journal of the ACM (JACM)

Linkless and flat embeddings in 3-space and the unknot problem

Proceedings of the twenty-sixth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

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.