GENERA OF THE LINKS DERIVED FROM 2-CONNECTED PLANE GRAPHS
2012 ◽
Vol 21
(14)
◽
pp. 1250129
◽
Keyword(s):
In this paper, we associate a plane graph G with an oriented link by replacing each vertex of G with a special oriented n-tangle diagram. It is shown that such an oriented link has the minimum genus over all orientations of its unoriented version if its associated plane graph G is 2-connected. As a result, the genera of a large family of unoriented links are determined by an explicit formula in terms of their component numbers and the degree sum of their associated plane graphs.
2013 ◽
Vol 23
(02)
◽
pp. 75-92
◽
Keyword(s):
2006 ◽
Vol 17
(05)
◽
pp. 1031-1060
◽
Keyword(s):
2009 ◽
Vol 18
(12)
◽
pp. 1711-1726
◽
Keyword(s):
2019 ◽
Vol 28
(14)
◽
pp. 1950085
Keyword(s):
2007 ◽
Vol 17
(03)
◽
pp. 201-230
◽
Keyword(s):
2018 ◽
Vol 27
(08)
◽
pp. 1850044
Keyword(s):