The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Distance Hereditary Graphs and the Interlace Polynomial
[article]
2006
arXiv
pre-print
The vertex-nullity interlace polynomial of a graph, described by Arratia, Bollobás and Sorkin as evolving from questions of DNA sequencing, and extended to a two-variable interlace polynomial by the same authors, evokes many open questions. These include relations between the interlace polynomial and the Tutte polynomial and the computational complexity of the vertex-nullity interlace polynomial. Here, we prove that the one-variable vertex-nullity interlace polynomial is in general #P-hard to
arXiv:math/0604088v2
fatcat:frqcvonlafbfpf74kqy73k5nxq