More intrinsically knotted graphs
From MaRDI portal
Publication:3422129
Recommendations
Cited in
(22)- A newly recognized intrinsically knotted graph
- Intrinsic linking and knotting are arbitrarily complex in directed graphs
- Intrinsic knotting and linking of almost complete graphs
- scientific article; zbMATH DE number 4047765 (Why is no real title available?)
- Intrinsically knotted graphs with linklessly embeddable simple minors
- Intrinsic knotting and linking of complete graphs
- Minimally knotted graphs in \(S^ 3\)
- On intrinsically knotted or completely 3-linked graphs
- Two More Proofs that the Kinoshita Graph is Knotted
- On Conway-Gordon type theorems for graphs in the Petersen family
- More intrinsically knotted graphs with 22 edges and the restoring method
- On graphs for which every planar immersion lifts to a knotted spatial embedding
- Linearly free graphs
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- Intrinsically knotted and 4-linked directed graphs
- Most graphs are knotted
- Intrinsically knotted graphs
- An algorithm for detecting intrinsically knotted graphs
- Counting links and knots in complete graphs
- More classes of stuck unknotted hexagons
- INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
- Triangle-\(Y\) exchanges on intrinsic knotting of almost complete and complete partite graphs
This page was built for publication: More intrinsically knotted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422129)