The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph
From MaRDI portal
Publication:1010685
zbMath1159.05005MaRDI QIDQ1010685
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129752
05A19: Combinatorial identities, bijective combinatorics