Dips at small sizes for topological graph obstruction sets
From MaRDI portal
Publication:6648257
DOI10.1016/J.DAM.2024.08.022MaRDI QIDQ6648257
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs of 20 edges are 2-apex, hence unknotted
- On intrinsically knotted or completely 3-linked graphs
- Graph minors. XX: Wagner's conjecture
- 103 graphs that are irreducible for the projective plane
- Six variations on a theme: almost planar graphs
- A large set of torus obstructions and how they were discovered
- Sur le problème des courbes gauches en topologie.
- Sachs' linkless embedding conjecture
- All minor-minimal apex obstructions with connectivity two
- Many, many more intrinsically knotted graphs
- Primitive spatial graphs and graph minors
- Homomorphiesätze für Graphen
- Über eine Eigenschaft der ebenen Komplexe.
- Graphs on surfaces
- Knots and links in spatial graphs
- Intrinsically knotted graphs
- A kuratowski theorem for the projective plane
- Recent developments in spatial graph theory
- Order nine MMIK graphs
- The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and obstructions to 𝑛-apex.
- Bipartite Intrinsically Knotted Graphs with 22 Edges
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- An Algorithm for Detecting Intrinsically Knotted Graphs
- Generation of Triangulations of the Sphere
- Realization of knots and links in a spatial graph
- Maximal knotless graphs
- Intrinsically knotted graphs with linklessly embeddable simple minors
This page was built for publication: Dips at small sizes for topological graph obstruction sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648257)
