Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The complexities of the coefficients of the Tutte polynomial

From MaRDI portal
Publication:1346689
Jump to:navigation, search

DOI10.1016/0166-218X(94)00097-WzbMath0830.68096MaRDI QIDQ1346689

J. D. Annan

Publication date: 10 April 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

Tutte polynomial


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)


Related Items (4)

Edge cut splitting formulas for Tutte-Grothendieck invariants ⋮ On the algebraic complexity of some families of coloured Tutte polynomials ⋮ Interpretations of the Tutte and characteristic polynomials of matroids ⋮ Interpretations of the Tutte polynomials of regular matroids



Cites Work

  • The complexity of computing the permanent
  • The Complexity of Enumeration and Reliability Problems
  • On the computational complexity of the Jones and Tutte polynomials
  • A Contribution to the Theory of Chromatic Polynomials
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: The complexities of the coefficients of the Tutte polynomial

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1346689&oldid=13481427"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki