More intrinsically knotted graphs
From MaRDI portal
Publication:3422129
DOI10.1002/JGT.20200zbMATH Open1120.57001OpenAlexW4240584420MaRDI QIDQ3422129FDOQ3422129
Authors: Joel Foisy 
Publication date: 9 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20200
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
Cited In (21)
- Intrinsic knotting and linking of almost complete graphs
- Intrinsic knotting and linking of complete graphs
- More intrinsically knotted graphs with 22 edges and the restoring method
- Title not available (Why is that?)
- INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
- More classes of stuck unknotted hexagons
- Linearly free graphs
- Intrinsically knotted graphs
- Two More Proofs that the Kinoshita Graph is Knotted
- Minimally knotted graphs in \(S^ 3\)
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- Counting links and knots in complete graphs
- A newly recognized intrinsically knotted graph
- On intrinsically knotted or completely 3-linked graphs
- Triangle-\(Y\) exchanges on intrinsic knotting of almost complete and complete partite graphs
- On Conway-Gordon type theorems for graphs in the Petersen family
- An algorithm for detecting intrinsically knotted graphs
- Intrinsic linking and knotting are arbitrarily complex in directed graphs
- Intrinsically knotted and 4-linked directed graphs
- Most graphs are knotted
- On graphs for which every planar immersion lifts to a knotted spatial embedding
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)
