{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:19:16Z","timestamp":1759335556930},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T00:00:00Z","timestamp":1347321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s00373-012-1217-4","type":"journal-article","created":{"date-parts":[[2012,9,10]],"date-time":"2012-09-10T09:01:43Z","timestamp":1347267703000},"page":"1839-1865","source":"Crossref","is-referenced-by-count":3,"title":["A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families"],"prefix":"10.1007","volume":"29","author":[{"given":"Markus","family":"Kuba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alois","family":"Panholzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,11]]},"reference":[{"key":"1217_CR1","doi-asserted-by":"crossref","unstructured":"Aldous, D.: The continuum random tree. An overview. In: Stochastic Analysis, London Mathematical Society Lecture Notes Series, vol. 167, pp. 23\u201370, Cambridge University Press, Cambride (1991)","DOI":"10.1017\/CBO9780511662980.003"},{"key":"1217_CR2","volume-title":"Combinatorial Species and Tree-Like Structures","author":"F. Bergeron","year":"1998","unstructured":"Bergeron F., Labelle G., Leroux P.: Combinatorial Species and Tree-Like Structures. Cambridge University Press, Cambridge (1998)"},{"key":"1217_CR3","doi-asserted-by":"crossref","unstructured":"Chen W.Y.C., Gao O.X.Q., Guo P.L.: Hook length formulas for trees by Han\u2019s expansion. Electron. J. Comb. 16,\u2013#R62 (2009)","DOI":"10.37236\/151"},{"key":"1217_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P. Flajolet","year":"2009","unstructured":"Flajolet P., Sedgewick R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"key":"1217_CR5","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/jgt.3190190402","volume":"19","author":"I. Gessel","year":"1995","unstructured":"Gessel I., Sagan B., Yeh Y.-N.: Enumeration of trees by inversions. J. Graph Theory 19, 435\u2013459 (1995)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1217_CR6","doi-asserted-by":"crossref","first-page":"#R27","DOI":"10.37236\/1884","volume":"11","author":"I. Gessel","year":"2006","unstructured":"Gessel I., Seo S.: A refinement of Cayley\u2019s formula for trees. Electron. J. Comb. 11(2), #R27 (2006)","journal-title":"Electron. J. Comb."},{"key":"1217_CR7","doi-asserted-by":"crossref","unstructured":"Gittenberger, B., Panholzer, A.: Some results for monotonically labelled simply generated trees. In: Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 173\u2013180 (2005)","DOI":"10.46298\/dmtcs.3356"},{"key":"1217_CR8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00493-010-2503-5","volume":"30","author":"G.-N. Han","year":"2010","unstructured":"Han G.-N.: New hook length formulas for binary trees. Combinatorica 30, 253\u2013256 (2010)","journal-title":"Combinatorica"},{"key":"1217_CR9","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/080720498","volume":"23","author":"G.-N. Han","year":"2009","unstructured":"Han G.-N.: Yet another generalization of Postnikov\u2019s hook length formula for binary trees. SIAM J. Discrete Math. 23, 661\u2013664 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"1217_CR10","doi-asserted-by":"crossref","first-page":"#R133","DOI":"10.37236\/857","volume":"15","author":"G.-N. Han","year":"2008","unstructured":"Han G.-N.: Discovering hook length formulas by an expansion technique. Electron. J. Comb. 15, #R133 (2008)","journal-title":"Electron. J. Comb."},{"key":"1217_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0166-218X(84)90064-7","volume":"7","author":"P. Kirschenhofer","year":"1984","unstructured":"Kirschenhofer P.: On the average shape of monotonically labelled tree structures. Discrete Appl. Math. 7, 161\u2013181 (1984)","journal-title":"Discrete Appl. Math."},{"key":"1217_CR12","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1214\/009117906000000908","volume":"35","author":"J.-F. Marckert","year":"2007","unstructured":"Marckert J.-F., Miermont G.: Invariance principles of random bipartite planar maps. Ann. Probab. 35, 1642\u20131705 (2007)","journal-title":"Ann. Probab."},{"key":"1217_CR13","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"Meir A., Moon J.W.: On the altitude of nodes in random trees. Can. J. Math. 30, 997\u20131015 (1978)","journal-title":"Can. J. Math."},{"key":"1217_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0012-365X(01)00282-5","volume":"250","author":"A. Panholzer","year":"2002","unstructured":"Panholzer A., Prodinger H.: Bijections for ternary trees and non-crossing trees. Discrete Math. 250, 181\u2013195 (2002)","journal-title":"Discrete Math."},{"key":"1217_CR15","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1093\/imrn\/rnn153","volume":"6","author":"A. Postnikov","year":"2009","unstructured":"Postnikov A.: Permutohedra, associahedra, and beyond. Int. Math. Res. Notices 6, 1026\u20131106 (2009)","journal-title":"Int. Math. Res. Notices"},{"key":"1217_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(83)90043-4","volume":"5","author":"H. Prodinger","year":"1983","unstructured":"Prodinger H., Urbanek F.J.: On monotone functions of tree structures. Discrete Appl. Math. 5, 223\u2013239 (1983)","journal-title":"Discrete Appl. Math."},{"key":"1217_CR17","unstructured":"Sagan, B.E.: Probabilistic proofs of hook length formulas involving trees. S\u00e9minaire Lotharingien de Combinatoire, vol. 61A. Article B61Ab (2009)"},{"key":"1217_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics, vol. 2","author":"R. Stanley","year":"1999","unstructured":"Stanley R.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)"},{"key":"1217_CR19","unstructured":"Yang, L.L.M.: Generalizations of Han\u2019s Hook length identities. arXiv:0805.0109"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1217-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1217-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1217-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,28]],"date-time":"2022-01-28T14:25:24Z","timestamp":1643379924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1217-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1217"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1217-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,11]]}}}