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] (2008)
- Volume: 15, Issue: 1, page Research Paper N28, 5 p.-Research Paper N28, 5 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topMerino, 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] 15.1 (2008): Research Paper N28, 5 p.-Research Paper N28, 5 p.. <http://eudml.org/doc/129752>.
@article{Merino2008,
author = {Merino, C.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper N28, 5 p.-Research Paper N28, 5 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.},
url = {http://eudml.org/doc/129752},
volume = {15},
year = {2008},
}
TY - JOUR
AU - Merino, C.
TI - The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2008
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 15
IS - 1
SP - Research Paper N28, 5 p.
EP - Research Paper N28, 5 p.
LA - eng
UR - http://eudml.org/doc/129752
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.