Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes)

Mehdi Naima. Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes). PhD thesis, University Sorbonne Paris Nord, France, 2020. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.