The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.

Gessel, Ira M., and Sagan, Bruce E.. "The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.." The Electronic Journal of Combinatorics [electronic only] 3.2 (1996): . <http://eudml.org/doc/119042>.

@article{Gessel1996,
author = {Gessel, Ira M., Sagan, Bruce E.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Tutte polynomial; simplicial complexes; partition; depth-first search},
language = {eng},
number = {2},
pages = {},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.},
url = {http://eudml.org/doc/119042},
volume = {3},
year = {1996},
}

TY - JOUR
AU - Gessel, Ira M.
AU - Sagan, Bruce E.
TI - The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1996
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 3
IS - 2
SP -
LA - eng
KW - Tutte polynomial; simplicial complexes; partition; depth-first search
UR - http://eudml.org/doc/119042
ER -