Graphical calculi for the Dubrovnik polynomial with applications (Q2909503)

This paper uses the Dubrovnik version of the Kauffman polynomial [\textit{L. H. Kauffman}, Trans. Am. Math. Soc. 318, No. 2, 417--471 (1990; Zbl 0763.57004)] to introduce two (related) polynomials of plane graphs.NEWLINENEWLINEIf \(G\) is a plane graph, the first polynomial, \([G]\), is defined so as to agree with the Dubrovnik polynomial of the link obtained from \(G\) by forming its medial graph and assigning a particular crossing structure to each vertex to make it into an alternating link. A universality theorem for \([G]\) is given. The second polynomial, \(N(G)\), is defined for doubly edge-weighted plane graphs. It is defined in such a way that it agrees with the Dubrovnik polynomials of links obtained by replacing each edge of a plane graph with a tangle. The paper concludes with a discussion of implications to \textit{A. S. Lipson}'s result [Enseign. Math., II. Sér. 36, No. 1-2, 93--114 (1990; Zbl 0711.57004)] that relates the Dubrovnik polynomial and the Goeritz matrix of a link.