W.Y.C. Chen, O.X.Q. Gao and P.L. Guo,
Hook length formulas for trees by Han's expansion,
Electron. J. Combin. 16 (2009) #R62.

Cited by

  1. K. Anders and K. Archer, Rooted forests that avoid sets of permutations, arXiv:1607.03046.

  2. W.Y.C. Chen, O.X.Q. Gao and P.L. Guo, On Han's hook length formulas for trees, Electron. J. Combin. 18 (2011) Paper 155, 8 pp.

  3. N. Eriksen, Combinatorial proofs for some forest hook length identities, Preprint.

  4. J. Irving and A. Rattan, Parking functions, tree depth and factorizations of the full cycle into transpositions, Discrete Math. Theor. Comput. Sci. (2016).

  5. B.R. Jones and K. Yeats, Tree hook length formulae, Feynman rules and B-series, arXiv:1412.6053.

  6. M. Kuba, A note on hook length formulas for trees, arXiv:1004.1883.

  7. M. Kuba and A. Panholzer, Bilabelled increasing trees and hook-length formulae, European J. Combin. 33 (2012) 248-258.

  8. M. Kuba and A. Panholzer, A unifying approach for proving hook-length formulas for weighted tree families, Graphs Combin. 29 (2013) 1839-1865.

  9. M.Kuba and A. Panholzer, Combinatorial families of multilabelled increasing trees and hook-length formulas, Discrete Math. 339 (2016) 227-254.

  10. H. Wang, Note on "hook-length'' as a graph invariant of trees, J. Comb. 8(1) (2017) 209-226.