Tutte polynomials computable in polynomial time

  • Oxley J
  • Welsh D
  • 4


    Mendeley users who have this article in their library.
  • 25


    Citations of this article.


We show that for any accessible class of matroids of bounded width, the Tutte polynomial is computable in polynomial time. © 1992.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • J. G. Oxley

  • D. J.A. Welsh

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free