20 citations to https://www.mathnet.ru/rus/rm1248
  1. Yang Li, Zhicong Lin, Tongyuan Zhao, “Two involutions on binary trees and generalizations”, Advances in Applied Mathematics, 156 (2024), 102677  crossref
  2. Zhicong Lin, Jing Liu, Suijie Wang, Wenston J.T. Zang, “More bijective combinatorics of weakly increasing trees”, Advances in Applied Mathematics, 160 (2024), 102755  crossref
  3. Swapnil Garg, Alan Peng, “Classical and consecutive pattern avoidance in rooted forests”, Journal of Combinatorial Theory, Series A, 194 (2023), 105699  crossref
  4. William Y. C. Chen, Amy M. Fu, “A grammatical calculus for peaks and runs of permutations”, J Algebr Comb, 57:4 (2023), 1139  crossref
  5. Olivier Bodini, Antoine Genitrini, Mehdi Naima, Lecture Notes in Computer Science, 13568, LATIN 2022: Theoretical Informatics, 2022, 493  crossref
  6. Mackenzie Simper, Julia A. Palacios, “An adjacent-swap Markov chain on coalescent trees”, J. Appl. Probab., 59:4 (2022), 1243  crossref
  7. Zhicong Lin, Jun Ma, Shi-Mei Ma, Yanghongbo Zhou, “Weakly increasing trees on a multiset”, Advances in Applied Mathematics, 129 (2021), 102206  crossref
  8. Yu. S. Volkov, “Efficient computation of Favard constants and their connection to Euler polynomials and numbers”, Сиб. электрон. матем. изв., 17 (2020), 1921–1942  mathnet  crossref
  9. Shao-Hua Liu, “An involution on increasing trees”, Discrete Mathematics, 342:12 (2019), 111612  crossref
  10. Toufik Mansour, Howard Skogman, Rebecca Smith, “Passing through a stack k times with reversals”, European Journal of Combinatorics, 81 (2019), 309  crossref
1
2
Следующая