Abstract
We show that for any accessible class of matroids of bounded width, the Tutte polynomial is computable in polynomial time. © 1992.
Cite
CITATION STYLE
APA
Oxley, J. G., & Welsh, D. J. A. (1992). Tutte polynomials computable in polynomial time. Discrete Mathematics, 109(1–3), 185–192. https://doi.org/10.1016/0012-365X(92)90289-R
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free