Many, many more intrinsically knotted graphs
From MaRDI portal
Publication:2453739
Abstract: We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.
Cites work
- A newly recognized intrinsically knotted graph
- An algorithm for detecting intrinsically knotted graphs
- Graph minors. XX: Wagner's conjecture
- Graphs of 20 edges are 2-apex, hence unknotted
- scientific article; zbMATH DE number 3906521 (Why is no real title available?)
- scientific article; zbMATH DE number 125433 (Why is no real title available?)
- Intrinsic knotting and linking of almost complete graphs
- Intrinsically knotted graphs
- Knots and links in spatial graphs
- Many, many more intrinsically knotted graphs
- On intrinsically knotted or completely 3-linked graphs
- Primitive spatial graphs and graph minors
- Realization of knots and links in a spatial graph
- Sachs' linkless embedding conjecture
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- The Y-triangle move does not preserve intrinsic knottedness
Cited in
(23)- Chirality for simple graphs of size up to 12
- Bipartite intrinsically knotted graphs with 23 edges
- A new intrinsically knotted graph with 22 edges
- Many, many more intrinsically knotted graphs
- The minor minimal intrinsically chiral graphs
- Family sizes for complete multipartite graphs
- Recent developments in spatial graph theory
- Order nine MMIK graphs
- The \(K_{n+5}\) and \(K_{3^2,1^n}\) families and obstructions to \(n\)-apex.
- More intrinsically knotted graphs with 22 edges and the restoring method
- Tree densities in sparse graph classes
- Ideal spatial graph configurations
- Bipartite intrinsically knotted graphs with 22 edges
- Two More Proofs that the Kinoshita Graph is Knotted
- Linearly free graphs
- Maximal knotless graphs
- Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
- Complete minors in complements of nonseparating planar graphs
- On intrinsically knotted or completely 3-linked graphs
- Forbidden minors: finding the finite few
- Dips at small sizes for topological graph obstruction sets
- Intrinsically knotted graphs and connected domination
- The smallest bipartite intrinsically knotted graph
This page was built for publication: Many, many more intrinsically knotted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453739)