Linkless and flat embeddings in 3-space

DOI10.1007/S00454-012-9413-9zbMath1241.05095OpenAlexW2101632844MaRDI QIDQ420569

Stephan Kreutzer, Ken-ichi Kawarabayashi, Bojan Mohar

Publication date: 22 May 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-012-9413-9

zbMATH Keywords

knotunknotflat embeddinglinkless embedding

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On the number of edges in maximally linkless graphs ⋮ A more accurate view of the flat wall theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The disjoint paths problem in quadratic time
• \(K_{6}\) minors in large 6-connected graphs
• Graph minors. XX: Wagner's conjecture
• A polynomial-time algorithm to find a linkless embedding of a graph
• Graph minors. V. Excluding a planar graph
• A linear algorithm for embedding planar graphs using PQ-trees
• Disjoint paths in graphs
• 2-linked graphs
• On planarity of graphs in 3-manifolds
• On the null space of a Colin de Verdière matrix
• Highly connected sets and the excluded grid theorem
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Quickly excluding a planar graph
• Multiplicities of eigenvalues and tree-width of graphs
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Graph minors. IX: Disjoint crossed paths
• Time bounded random access machines
• Rooted minor problems in highly connected graphs
• Graph minors. XIII: The disjoint paths problem
• Kuratowski chains
• Petersen family minors
• Sachs' linkless embedding conjecture
• Packing circuits in eulerian digraphs
• Homomorphiesätze für Graphen
• A shorter proof of the graph minor algorithm
• A linear-time algorithm to find a separator in a graph excluding a minor
• Knots and links in spatial graphs
• Easy problems for tree-decomposable graphs
• Depth-First Search and Kuratowski Subgraphs
• Applications of a Planar Separator Theorem
• Efficient Planarity Testing
• A Minimax Theorem for Directed Graphs
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Approximation algorithms for NP-complete problems on planar graphs
• A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
• Linkless and flat embeddings in 3-space and the unknot problem
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Linkless and flat embeddings in 3-space