Intrinsic knotting of almost complete partite graphs
From MaRDI portal
Publication:5499352
Recommendations
- Triangle-\(Y\) exchanges on intrinsic knotting of almost complete and complete partite graphs
- A sufficient condition for intrinsic knotting of bipartite graphs
- A newly recognized intrinsically knotted graph
- More intrinsically knotted graphs with 22 edges and the restoring method
- On intrinsically knotted or completely 3-linked graphs
Cited in
(7)- Intrinsic knotting and linking of complete graphs
- Partial duals of plane graphs, separability and the graphs of knots
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- A newly recognized intrinsically knotted graph
- Triangle-\(Y\) exchanges on intrinsic knotting of almost complete and complete partite graphs
- A sufficient condition for intrinsic knotting of bipartite graphs
- Knots in the canonical book representation of complete graphs
This page was built for publication: Intrinsic knotting of almost complete partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5499352)