In this survey of graph polynomials, we emphasize the Tutte polynomial and a
selection of closely related graph polynomials. We explore some of the Tutte
polynomial's many properties and applications and we use the Tutte polynomial
to showcase a variety of principles and techniques for graph polynomials in
general. These include several ways in which a graph polynomial may be defined
and methods for extracting combinatorial information and algebraic properties
from a graph polynomial. We also use the Tutte polynomial to demonstrate how
graph polynomials may be both specialized and generalized, and how they can
encode information relevant to physical applications. We conclude with a brief
discussion of computational complexity considerations.
%0 Journal Article
%1 citeulike:3973700
%A Ellis-Monaghan, Joanna
%A Merino, Criel
%D 2008
%K citeulike grafos, graphs, polinomio, polynomial, tutte
%T Graph polynomials and their applications I: The Tutte polynomial
%U http://arxiv.org/abs/0803.3079
%X In this survey of graph polynomials, we emphasize the Tutte polynomial and a
selection of closely related graph polynomials. We explore some of the Tutte
polynomial's many properties and applications and we use the Tutte polynomial
to showcase a variety of principles and techniques for graph polynomials in
general. These include several ways in which a graph polynomial may be defined
and methods for extracting combinatorial information and algebraic properties
from a graph polynomial. We also use the Tutte polynomial to demonstrate how
graph polynomials may be both specialized and generalized, and how they can
encode information relevant to physical applications. We conclude with a brief
discussion of computational complexity considerations.
@article{citeulike:3973700,
abstract = {{In this survey of graph polynomials, we emphasize the Tutte polynomial and a
selection of closely related graph polynomials. We explore some of the Tutte
polynomial's many properties and applications and we use the Tutte polynomial
to showcase a variety of principles and techniques for graph polynomials in
general. These include several ways in which a graph polynomial may be defined
and methods for extracting combinatorial information and algebraic properties
from a graph polynomial. We also use the Tutte polynomial to demonstrate how
graph polynomials may be both specialized and generalized, and how they can
encode information relevant to physical applications. We conclude with a brief
discussion of computational complexity considerations.}},
added-at = {2017-09-08T10:52:59.000+0200},
archiveprefix = {arXiv},
author = {Ellis-Monaghan, Joanna and Merino, Criel},
biburl = {https://www.bibsonomy.org/bibtex/2ee2968eb004ead7cb88f6699cce6a307/fernand0},
citeulike-article-id = {3973700},
citeulike-linkout-0 = {http://arxiv.org/abs/0803.3079},
citeulike-linkout-1 = {http://arxiv.org/pdf/0803.3079},
day = 28,
eprint = {0803.3079},
interhash = {f74f3d12adf9d176314b2f082f9f6940},
intrahash = {ee2968eb004ead7cb88f6699cce6a307},
keywords = {citeulike grafos, graphs, polinomio, polynomial, tutte},
month = jun,
posted-at = {2009-01-28 18:29:27},
priority = {2},
timestamp = {2017-09-08T10:53:23.000+0200},
title = {{Graph polynomials and their applications I: The Tutte polynomial}},
url = {http://arxiv.org/abs/0803.3079},
year = 2008
}