[1] N. G. de Bruijn, B. J. M. Morselt, A note on plane trees, J. Combin. Theory 2(1) (1967) 27–34.
https://doi.org/10.1016/S0021-9800(67)80111-X
[2] N. Dershowitz, S. Zaks, Enumerations of ordered trees, Discrete Math. 31(1) (1980) 9–28.
https://doi.org/10.1016/0012-365X(80)90168-5
[3] E. Deutsch, M. Noy, Statistics on non-crossing trees, Discrete Math. 254 (2002) 75–87.
https://doi.org/10.1016/S0012-365X(01)00366-1
[4] R. R. X. Du, J. He, X. Yun, Counting vertices in plane and k-ary trees with given outdegree, Graphs
Comb. 35 (2019) 221–229. https://doi.org/10.48550/arXiv.1501.07468
[5] S. P. Eu, S. Seo, H. Shin, Enumerations of vertices among all rooted ordered trees with levels and
degrees, Discrete Math. 340(9) (2017) 2123–2129.
https://doi.org/10.48550/arXiv.1605.00715[6] P. Flajolet, M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Math. 204(1-3)
(1999) 203 – 229. https://doi.org/10.1016/S0012-365X(98)00372-0
[7] N. S. S. Gu, H. Prodinger, Bijections for 2-plane trees and ternary trees, Europ. J. Combin. 30(4)
(2009) 969–985. https://doi.org/10.1016/j.ejc.2008.06.006
[8] N. S. S. Gu, H. Prodinger, S. Wagner, Bijections for a class of labeled plane trees, Europ. J. Combin.
31(3) (2010) 720–732. https://doi.org/10.1016/j.ejc.2009.10.007
[9] Y. W. Kariuki, I. O. Okoth, Bijections of plane Husimi graphs and certain combinatorial structures,
Eur. J. Math. Appl. 3 (2023) 21. https://doi.org/10.28919/eima.2023.3.21
[10] Y. W. Kariuki, I. O. Okoth, Enumeration and bijections of a class of labelled plane trees and related
structures, Preprint (2024).
[11] Y. W. Kariuki, I. O. Okoth, F. O. Nyamwala, Counting formulas and bijections of nondecreasing
2-noncrossing trees, Electron. J. Math. 7 (2024) 69–87. https://doi.org/10.47443/ejm.2024.029
[12] M. Noy, Enumeration of noncrossing trees on a circle, In Proceedings of the 7th Conference on
Formal Power Series and Algebraic Combinatorics (Noisy-le-Grand, 1995) 180 (1998) 301–313.
https://doi.org/10.1016/S0012-365X(97)00121-0
[13] A. P. O. Nyariaro, I.O. Okoth, Bijections for classes of labelled trees, Trans. Combin. 13 (2024) 197–
211. http://dx.doi.org/10.22108/toc.2023.132794.1965
[14] A. O. Nyariaro, I. O. Okoth, Enumeration of k-plane trees and forests, Commun. Cryptogr. &
Computer Sci. 2024(2) (2024) 152–168. http://cccs.sgh.ac.ir/Articles/2024/issue 2/2-4
[15] F. O. Oduol, I. O. Okoth, Counting vertices among all noncrossing trees by levels and degrees, Commun. Cryptogr. & Computer Sci. 2024(2) (2024) 193–212. http:// cccs.sgh.ac.ir/ Articles/2024/ issue 2/2-7
[16] F. O. Oduol, I. O. Okoth, F. O. Nyamwala, Enumeration of a variant of k-plane trees, Preprint
(2024).
[17] F. O. Oduol, I. O. Okoth, F. O. Nyamwala, Enumeration of a variant of k-noncrossing trees, Preprint
(2024).
[18] F. O. Oduol, I. O. Okoth, F. O. Nyamwala, Generalization of a variant of k-plane trees, Mathematics
and Systems Science 3(2) (2025) 3273. https://doi.org/10.54517/mss3273
[19] I. O. Okoth, Bijections of k-plane trees, Open J. Discret. Appl. Math. 5(1) (2022) 29–35.
https://doi.org/10.30538/psrp-odam2022.0068
[20] I. O. Okoth, Combinatorics of oriented trees and tree-like structures, PhD Thesis, Stellenbosch University (2015). https://scholar.sun.ac.za/server/api/core/bitstreams/345540f5-7912-44dc-bd6ad3b7f89c0df5
[21] I. O. Okoth, Enumeration of k-noncrossing trees and forests, Commun. Comb. Optim. 7 (2022)
301–311. https://doi.org/10.22049/cco.2022.26903.1162
[22] I. O. Okoth, On Noncrossing and Plane Tree-Like Structures, Commun. Adv. Math. Sc. 4 (2021)
89–99. https://doi.org/10.33434/cams.803065
[23] I. O. Okoth, On 2-noncrossing increasing trees, Open J. Discret. Appl. Math. 6(9) (2021) 39–50.
https://doi.org/10.30538/psrp-odam2023.0087
[24] I. O. Okoth, Refined enumeration of 2-noncrossing trees, Notes Number Theory Discret. Math., 27
(2021) 201–210. https://doi.org/10.7546/nntdm.2021.27.2.201-210
[25] I. O. Okoth, D. M. Kasyoki, Generalized plane trees, Preprint (2024).
[26] I. O. Okoth, S. Wagner, Refined enumeration of k-plane trees and k-noncrossing trees, Ann. Combin. (2024) 1–33. https://doi.org/10.48550/arXiv.2205.01002
[27] C. A. Onyango, I. O. Okoth, D. M. Kasyoki, Enumeration of plane and d-ary tree-like structures, Ann. Math. Comp. Sci. 17 (2023) 10–25. https://annalsmcs.org/ index.php/amcs/ article/view/190/113
[28] S. X. M. Pang, L. Lv, K-noncrossing trees and k-proper trees, 2nd International Conference on
Information Engineering and Computer Science, Wuhan (2010) 1–3. https://doi.org/ 10.1109/ICIECS.2010.5677757
[29] A. Panholzer, H. Prodinger, Bijection for ternary trees and non-crossing trees, Discrete Math. 250
(2002), 115–125. https://doi.org/ 10.1016/ S0012-365X(01)00282-5
[30] N. J. A. Sloane et al., The On-Line Encyclopedia of Integer Sequences, 2019. https:// doi.org/10.1007/ 978-3-540-73086-6 12
[31] R. P. Stanley, Enumerative Combinatorics, Vol. 2, volume 62 of Cambridge Studies in AdvancedMathematics, Cambridge University Press, Cambridge, 1999. https:// api.pageplace.de/ preview9780511835568 A23680075.pdf
[32] R. P. Stanley, Exercises on Catalan numbers and related numbers. https:// math.mit.edu/rstan/ec/ catalan.pdf
[33] H. S. Wilf, Generatingfunctionology, A. K. Peters, Ltd., Natick, MA, USA, 2006. https://www2.math.upenn.edu/ wilf/ gfology2.pdf
[34] S. H. F. Yan, X. Liu, 2-noncrossing trees and 5-ary trees, Discrete Math. 309 (2009) 6135–6138. https://doi.org/10.1016/j.disc.2009.03.044
)
)