22 citations to https://www.mathnet.ru/rus/rm1248
-
Shao-Hua Liu, “An involution on increasing trees”, Discrete Mathematics, 342:12 (2019), 111612
-
Toufik Mansour, Howard Skogman, Rebecca Smith, “Passing through a stack k times with reversals”, European Journal of Combinatorics, 81 (2019), 309
-
Beatriz Carely Luna-Olivera, Criel Merino, Marcelino Ramírez-Ibáñez, “More connections between the matching polynomial and the chromatic polynomial”, AKCE International Journal of Graphs and Combinatorics, 16:3 (2019), 319
-
William Y.C. Chen, Amy M. Fu, “Context-free grammars for permutations and increasing trees”, Advances in Applied Mathematics, 82 (2017), 58
-
Markus Kuba, Alois Panholzer, “Combinatorial families of multilabelled increasing trees and hook-length formulas”, Discrete Mathematics, 339:1 (2016), 227
-
A. J. Goodall, C. Merino, A. Mier, M. Noy, “On the Evaluation of the Tutte Polynomial at the Points (1, –1) and (2, –1)”, Ann. Comb, 2013
-
Jun Ma, Yeong-Nan Yeh, “Combinatorial interpretations for TG(1, −1)”, J. Graph Theory, 2011, n/a
-
Enumerative Combinatorics, 2011, 1
-
Fu Liu, “Combinatorial bases for multilinear parts of free algebras with two compatible brackets”, Journal of Algebra, 323:1 (2010), 132
-
Markus Kuba, Alois Panholzer, “On the degree distribution of the nodes in increasing trees☆”, Journal of Combinatorial Theory, Series A, 114:4 (2007), 597