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

H. Holst, van der

doi:10.1016/j.jctb.2008.10.002

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

H. Holst, van der

Research output: Contribution to journal › Article › Academic › peer-review

6 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 language	English
Pages (from-to)	512-530
Journal	Journal of Combinatorial Theory, Series B
Volume	99
Issue number	2
DOIs	https://doi.org/10.1016/j.jctb.2008.10.002
Publication status	Published - 2009

Access to Document

10.1016/j.jctb.2008.10.002

Cite this

@article{5df93dc5c2bd4c4781a59d8d111eabbe,

title = "A polynomial-time algorithm to find a linkless embedding of a graph",

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.",

author = "{Holst, van der}, H.",

year = "2009",

doi = "10.1016/j.jctb.2008.10.002",

language = "English",

volume = "99",

pages = "512--530",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Holst, van der, H.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1016/j.jctb.2008.10.002

DO - 10.1016/j.jctb.2008.10.002

M3 - Article

SN - 0095-8956

VL - 99

SP - 512

EP - 530

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 2

ER -

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

Abstract

Access to Document

Fingerprint

Cite this