On external activity and inversions in trees, Journal of Combinatorial Theory, Series B, vol.33, issue.1, pp.87-92, 1982. ,
DOI : 10.1016/0095-8956(82)90059-4
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions, Electron. J. Combin, vol.3, p.9, 1996. ,
Depth-first search as a combinatorial correspondence, Journal of Combinatorial Theory, Series A, vol.26, issue.3, pp.308-313, 1979. ,
DOI : 10.1016/0097-3165(79)90108-0
Increasing trees and alternating permutations, Russian Math, Surveys, vol.49, pp.79-114, 1994. ,
DOI : 10.1070/rm1994v049n06abeh002448
Threshold graphs and related topics, Annals of Discrete Mathematics, 1995. ,
The number of 0?1?2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph, Electron. J. Combin, vol.15, p.28, 2008. ,
Complexity: knots, colourings and counting, 1993. ,
DOI : 10.1017/CBO9780511752506