The complexities of the coefficients of the Tutte polynomial

Abstract

AbstractThe complexity of calculating the coefficients of the Tutte polynomial of a graph is considered. The calculation of some coefficients is shown to be #P-complete, whereas some other coefficients can be computed in polynomial time. However, even for a hard coefficient, it can be decided in polynomial time whether it is less than a fixed constant