A Polynomial Invariant Of Twisted Graph Diagrams
From MaRDI portal
Publication:6205956
Abstract: Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
This page was built for publication: A Polynomial Invariant Of Twisted Graph Diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205956)
