The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.
Merino, C.
The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2008-01-01
EUDML-ID : urn:eudml:doc:129752 
@article{05540890,
     title = {The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {15},
     year = {2008},
     zbl = {1159.05005},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05540890}
}

Merino, C. The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.. The Electronic Journal of Combinatorics [electronic only], Tome 15 (2008) . http://gdmltest.u-ga.fr/item/05540890/