Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Two algorithms for unranking arborescences;Colbourn;J. Algorithms,1996
2. The hook graphs of the symmetric group;Frame;Canad. J. Math.,1954
3. Method for constructing bijections for classical partition identities;Garsia;Proc. Nat. Acad. Sci. U.S.A.,1981
4. Reverse plane partitions and tableau hook numbers;Hillman;J. Combin. Theory Ser. A,1976
5. An involution principle-free bijective proof of Stanley's hook-content formula;Krattenthaler;Discrete Math. Theoret. Comput. Sci.,1998
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献