Linkless and flat embeddings in 3-space

DOI10.1007/S00454-012-9413-9zbMATH Open1241.05095OpenAlexW2101632844MaRDI QIDQ420569FDOQ420569

Authors: Ken-ichi Kawarabayashi, Stephan Kreutzer, 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

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\)

zbMATH Keywords

unknotknotflat embeddinglinkless embedding

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Linkless embeddings of graphs in 3-space
• A polynomial-time algorithm to find a linkless embedding of a graph
• A more accurate view of the flat wall theorem
• On the number of edges in maximally linkless graphs
• Primitive spatial graphs and graph minors

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)