Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Algebraic graph theoryAlgorithmApex graphColin de Verdière graph invariant

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Intrinsically Knotted and 4-Linked Directed Graphs
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that… 
2012
2012
Linkless and Flat Embeddings in 3-Space
We consider piecewise linear embeddings of graphs in 3-space ℝ3. Such an embedding is linkless if every pair of disjoint cycles… 
2008
2008
Symplectic geometry, minors and graph Laplacians
2005
2005
Graphs that are intrinsically linked with an unused vertex
We examine graphs that, for every spatial embedding, have a pair of linked cycles such that linked cycles do not pass through… 
2004
2004
Intrinsic Linking of Complete Partite Graphs
We classify complete partite graphs with respect to intrinsic linking. In Adams's `The Knot Book', it is conjectured that on… 
2002
2002
Asymmetric two-colourings of graphs in S3
We prove that for any non-planar graph H, we can choose a two-colouring G of H such that G is intrinsically chiral, and if H is 3… 
1999
1999
Graphs with ( Edge ) Disjoint Links in Every Spatial Embedding
We describe some characteristics of graphs with (edge) disjoint pairs of links in every spatial embedding. In particular, we show… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)