Essential cycles in graph divides as a link representation (Q2372721): Difference between revisions

A graph divide is a generic immersion of a graph into the 2-dimensional unit disk. In an earlier work of the author, she constructed a way by which, to each graph divide, a link in \(S^3\) is associated [Algebr. Geom. Topol. 4, 571-594 (2004; Zbl 1055.57006)]. She determined the four-dimensional clasp numbers of the links of tree divides, and the Gordian numbers and clasp numbers of the links of certain circle divides. In this paper it is shown that there exist some graph divide links which can not be represented as links of graph divides including less circles or less cycles. Therefore the author's computations of the invariants may not be directly applied to general graph divide links.