A Polynomial Invariant Of Twisted Graph Diagrams
Geometric Topology
2007-06-20 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.0706.2854,
title = {A Polynomial Invariant Of Twisted Graph Diagrams},
author = {Jason Uhing},
journal= {arXiv preprint arXiv:0706.2854},
year = {2007}
}