scientific article
From MaRDI portal
Publication:3684140
zbMath0568.05026MaRDI QIDQ3684140
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
Intrinsic linking and knotting are arbitrarily complex in directed graphs ⋮ The complement problem for linklessly embeddable graphs ⋮ Crossing numbers and rotation numbers of cycles in a plane immersed graph ⋮ Intrinsically \(n\)-linked complete graphs ⋮ An infinite family of linklessly embeddable Tutte-4-connected graphs ⋮ Topological symmetry groups of the Petersen graph ⋮ Intrinsically linked graphs in projective space ⋮ Intrinsic linking and knotting of graphs in arbitrary 3-manifolds ⋮ Intrinsically knotted and 4-linked directed graphs ⋮ Capturing links in spatial complete graphs ⋮ Hadwiger numbers of self-complementary graphs ⋮ On operators which are power similar to hyponormal operators ⋮ Some `converses' to intrinsic linking theorems ⋮ Classifying intrinsically linked tournaments by score sequence ⋮ Family sizes for complete multipartite graphs ⋮ Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant ⋮ New bounds on maximal linkless graphs ⋮ Knotting and linking in the Petersen family ⋮ Phase transition of degeneracy in minor-closed families ⋮ Graphs of 20 edges are 2-apex, hence unknotted ⋮ Intrinsically linked signed graphs in projective space ⋮ Intrinsic 3-linkedness is not preserved by Y∇ moves ⋮ On Legendrian graphs ⋮ Many, many more intrinsically knotted graphs ⋮ Recent developments in spatial graph theory ⋮ Order nine MMIK graphs ⋮ Finite-to-one maps ⋮ The Y-triangle move does not preserve intrinsic knottedness ⋮ Intrinsically triple linked complete graphs ⋮ A user's guide to the topological Tverberg conjecture ⋮ More intrinsically knotted graphs with 22 edges and the restoring method ⋮ An intrinsic nontriviality of graphs ⋮ Most graphs are knotted ⋮ Intrinsic linking and knotting in tournaments ⋮ Intrinsically linked graphs and even linking number
This page was built for publication:
