SOME NEW INTRINSICALLY 3-LINKED GRAPHS
From MaRDI portal
Publication:4653059
DOI10.1142/S0218216504003652zbMath1071.57003OpenAlexW1965948062WikidataQ56431008 ScholiaQ56431008MaRDI QIDQ4653059
Publication date: 28 February 2005
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218216504003652
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (9)
Intrinsically \(n\)-linked complete graphs ⋮ Intrinsic linking in directed graphs ⋮ INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS ⋮ Intrinsic 3-linkedness is not preserved by Y∇ moves ⋮ SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS ⋮ LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7 ⋮ An intrinsic nontriviality of graphs ⋮ GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING ⋮ Intrinsically linked graphs and even linking number
Cites Work
This page was built for publication: SOME NEW INTRINSICALLY 3-LINKED GRAPHS