Linkless and flat embeddings in 3-space
From MaRDI portal
Publication:420569
Recommendations
- Linkless and flat embeddings in 3-space and the unknot problem
- Linkless embeddings of graphs in 3-space
- Embedding and knotting of flat compact surfaces in 3-space
- Embedding finite planar spaces into 3-dimensional projective spaces
- Flats in 3-manifolds
- Imbeddings of polyhedra in 3-manifolds
- Embedding theorems for locally projective three-dimensional linear spaces
- scientific article; zbMATH DE number 495571
- Geometric embedding invariants of simple closed curves in three-space
- On embedded flat surfaces in \(S^3\)
Cites work
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- scientific article; zbMATH DE number 5485559 (Why is no real title available?)
- scientific article; zbMATH DE number 1256757 (Why is no real title available?)
- scientific article; zbMATH DE number 475582 (Why is no real title available?)
- scientific article; zbMATH DE number 475583 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- 2-linked graphs
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Minimax Theorem for Directed Graphs
- A linear algorithm for embedding planar graphs using PQ-trees
- A linear-time algorithm to find a separator in a graph excluding a minor
- A polynomial-time algorithm to find a linkless embedding of a graph
- A shorter proof of the graph minor algorithm: the unique linkage theorem
- Applications of a Planar Separator Theorem
- Approximation algorithms for NP-complete problems on planar graphs
- Depth-First Search and Kuratowski Subgraphs
- Disjoint paths in graphs
- Easy problems for tree-decomposable graphs
- Efficient Planarity Testing
- Graph minors. IX: Disjoint crossed paths
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graph theory
- Graphs on surfaces
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Highly connected sets and the excluded grid theorem
- Homomorphiesätze für Graphen
- Knots and links in spatial graphs
- Kuratowski chains
- Linkless and flat embeddings in 3-space and the unknot problem
- Multiplicities of eigenvalues and tree-width of graphs
- On planarity of graphs in 3-manifolds
- On the null space of a Colin de Verdière matrix
- Packing circuits in eulerian digraphs
- Petersen family minors
- Quickly excluding a planar graph
- Rooted minor problems in highly connected graphs
- Sachs' linkless embedding conjecture
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- The disjoint paths problem in quadratic time
- Time bounded random access machines
- \(K_{6}\) minors in large 6-connected graphs
Cited in
(7)- Linkless embeddings of graphs in 3-space
- Primitive spatial graphs and graph minors
- A polynomial-time algorithm to find a linkless embedding of a graph
- Linkless and flat embeddings in 3-space and the unknot problem
- A more accurate view of the flat wall theorem
- On the number of edges in maximally linkless graphs
- Special embeddings of graphs into a three-dimensional space
This page was built for publication: Linkless and flat embeddings in 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420569)
