{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T04:39:59Z","timestamp":1725683999002},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"publisher","award":["13dz2260400"],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s00373-018-1975-8","type":"journal-article","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T03:09:37Z","timestamp":1542683377000},"page":"221-229","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees"],"prefix":"10.1007","volume":"35","author":[{"given":"Rosena R. X.","family":"Du","sequence":"first","affiliation":[]},{"given":"Jia","family":"He","sequence":"additional","affiliation":[]},{"given":"Xueli","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"key":"1975_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0012-365X(01)00121-2","volume":"241","author":"E Deutsch","year":"2001","unstructured":"Deutsch, E., Shapiro, L.: A survey of the Fine numbers. Discrete Math. 241, 241\u2013265 (2001)","journal-title":"Discrete Math."},{"key":"1975_CR2","unstructured":"Du, R.R.X., He, J., Yun, X.: Counting vertices in plane and k-ary trees with given outdegree. \n arXiv:1501.07468\n \n [math.CO]"},{"key":"1975_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0950184300002640","volume":"32","author":"A Erd\u00e9lyi","year":"1940","unstructured":"Erd\u00e9lyi, A., Etherington, I.M.H.: Some problems of non-associative combinations (2). Edinb. Math. Notes 32, 7\u201312 (1940)","journal-title":"Edinb. Math. Notes"},{"key":"1975_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0950184300002639","volume":"32","author":"IMH Etherington","year":"1940","unstructured":"Etherington, I.M.H.: Some problems of non-associative combinations (1). Edinb. Math. Notes 32, 1\u20136 (1940)","journal-title":"Edinb. Math. Notes"},{"key":"1975_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.disc.2003.07.011","volume":"281","author":"S Eu","year":"2004","unstructured":"Eu, S., Liu, S., Yeh, Y.: Odd or even on plane trees. Discrete Math. 281, 189\u2013196 (2004)","journal-title":"Discrete Math."},{"issue":"9","key":"1975_CR6","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.1016\/j.disc.2017.04.007","volume":"340","author":"S Eu","year":"2017","unstructured":"Eu, S., Seo, S., Shin, H.: Enumerations of vertices among all rooted ordered trees with levels and degrees. Discrete Math. 340(9), 2123\u20132129 (2017)","journal-title":"Discrete Math."},{"key":"1975_CR7","series-title":"Fundamental Algorithms","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading (1968)"},{"key":"1975_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1090\/S0002-9947-1960-0114765-9","volume":"94","author":"GN Raney","year":"1960","unstructured":"Raney, G.N.: Functional composition patterns and power series reversion. Trans. Am. Math. Soc. 94, 441\u2013451 (1960)","journal-title":"Trans. Am. Math. Soc."},{"key":"1975_CR9","unstructured":"Sloane, N.J.A.: Online Encyclopedia of Integer Sequence, published electronically at \n http:\/\/oeis.org"},{"key":"1975_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609589","volume-title":"Enumerative Combinatorics","author":"RP Stanley","year":"1999","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1975-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1975-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1975-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:47:17Z","timestamp":1574210837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1975-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,20]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1975"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1975-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,20]]},"assertion":[{"value":"29 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}