COMPLETELY DISTINGUISHABLE PROJECTIONS OF SPATIAL GRAPHS
2006 ◽
Vol 15
(01)
◽
pp. 11-19
◽
Keyword(s):
A generic immersion of a finite graph into the 2-space with p double points is said to be completely distinguishable if any two of the 2p embeddings of the graph into the 3-space obtained from the immersion by giving over/under information to each double point are not ambient isotopic in the 3-space. We show that only non-trivializable graphs and non-planar graphs have a non-trivial completely distinguishable immersion. We give examples of non-trivial completely distinguishable immersions of several non-trivializable graphs, the complete graph on n vertices and the complete bipartite graph on m + n vertices.
1970 ◽
Vol 22
(5)
◽
pp. 1082-1096
◽
1969 ◽
Vol 21
◽
pp. 1086-1096
◽
Keyword(s):
2011 ◽
Vol 3
(2)
◽
pp. 321-329
◽
Keyword(s):
2018 ◽
Vol 106
(2)
◽
pp. 515-527
2015 ◽
Vol 07
(04)
◽
pp. 1550040
◽
Keyword(s):
2013 ◽
Vol 23
(1)
◽
pp. 50-65
◽
2009 ◽
Vol 86
(1)
◽
pp. 111-122
◽
Keyword(s):
2017 ◽
Vol 104
(1)
◽
pp. 127-144
Keyword(s):