Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,595,504 papers from all fields of science
Search
Sign In
Create Free Account
Linkless embedding
Known as:
Intrinsically linked graph
, Knotless embedding
, Linklessly embeddable graph
In topological graph theory, a mathematical discipline, a linkless embedding of an undirected graph is an embedding of the graph into Euclidean space…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Algebraic graph theory
Algorithm
Apex graph
Colin de Verdière graph invariant
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Linkless and Flat Embeddings in 3-Space
K. Kawarabayashi
,
S. Kreutzer
,
B. Mohar
Discrete & Computational Geometry
2012
Corpus ID: 254035414
We consider piecewise linear embeddings of graphs in 3-space ℝ3. Such an embedding is linkless if every pair of disjoint cycles…
Expand
2005
2005
Graphs that are intrinsically linked with an unused vertex
Garry S. Bowlin
2005
Corpus ID: 16024478
We examine graphs that, for every spatial embedding, have a pair of linked cycles such that linked cycles do not pass through…
Expand
2004
2004
Intrinsic Linking of Complete Partite Graphs
R. Ottman
2004
Corpus ID: 124422970
We classify complete partite graphs with respect to intrinsic linking. In Adams's `The Knot Book', it is conjectured that on…
Expand
1999
1999
Graphs with ( Edge ) Disjoint Links in Every Spatial Embedding
Jennifer Hespen
,
Trent Lalonde
,
K. Thomas
1999
Corpus ID: 15162169
We describe some characteristics of graphs with (edge) disjoint pairs of links in every spatial embedding. In particular, we show…
Expand