INTRINSICALLY n-LINKED GRAPHS
From MaRDI portal
Publication:4541065
DOI10.1142/S0218216501001360zbMath0998.57008WikidataQ56431011 ScholiaQ56431011MaRDI QIDQ4541065
Joel Foisy, Ramin Naimi, Erica Flapan, James E. Pommersheim
Publication date: 30 July 2002
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ Intrinsically \(n\)-linked complete graphs ⋮ Intrinsically knotted and 4-linked directed graphs ⋮ INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS ⋮ Intrinsic 3-linkedness is not preserved by Y∇ moves ⋮ Some Ramsey-type results on intrinsic linking of \(n\)-complexes ⋮ Counting links and knots in complete graphs ⋮ SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS ⋮ Intrinsic linking and knotting in virtual spatial graphs ⋮ SOME NEW INTRINSICALLY 3-LINKED GRAPHS ⋮ GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING ⋮ PLANE CURVES IN AN IMMERSED GRAPH IN ℝ2 ⋮ Intrinsically triple linked complete graphs ⋮ An intrinsic nontriviality of graphs ⋮ Counting links in complete graphs ⋮ Intrinsic linking and knotting in tournaments ⋮ Intrinsic linking with linking numbers of specified divisibility ⋮ GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING ⋮ Intrinsically linked graphs and even linking number ⋮ Knots and links in spatial graphs: a survey
This page was built for publication: INTRINSICALLY n-LINKED GRAPHS