Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Chain enumeration and non-crossing partitions;Edelman;Discrete Math,1980
2. P.H. Edelman, Non-crossing partitions and the enumeration of ordered trees, in preparation.
3. Zeta polynomials and the Mobious function;Edelman;European J. Combinatorics,1980
4. Sur les partitions non croisees d'un cycle;Kreweras;Discrete Math.,1972
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献