INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
From MaRDI portal
Publication:3067865
DOI10.1142/S0218216510008455zbMath1232.57004OpenAlexW1989125782MaRDI QIDQ3067865
T. S. Michael, Brenda Johnson, Mark E. Kidwell
Publication date: 13 January 2011
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218216510008455
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Bipartite intrinsically knotted graphs with 23 edges ⋮ A new intrinsically knotted graph with 22 edges ⋮ Maximal knotless graphs ⋮ Graphs of 20 edges are 2-apex, hence unknotted ⋮ Recent developments in spatial graph theory ⋮ More intrinsically knotted graphs with 22 edges and the restoring method ⋮ Bipartite Intrinsically Knotted Graphs with 22 Edges
Cites Work
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Sachs' linkless embedding conjecture
- Über eine Eigenschaft der ebenen Komplexe
- Knots and links in spatial graphs
- More intrinsically knotted graphs
- Intrinsically knotted graphs
- A newly recognized intrinsically knotted graph
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
This page was built for publication: INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
