{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:24:58Z","timestamp":1648995898406},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T00:00:00Z","timestamp":1318291200000},"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,1]]},"DOI":"10.1007\/s00373-011-1097-z","type":"journal-article","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T14:32:20Z","timestamp":1318257140000},"page":"131-143","source":"Crossref","is-referenced-by-count":0,"title":["A Refinement of Leaves on Noncrossing Trees"],"prefix":"10.1007","volume":"29","author":[{"given":"Sabrina X. M.","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lun","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,11]]},"reference":[{"key":"1097_CR1","doi-asserted-by":"crossref","unstructured":"Chen, W.Y.C., Yan, S.H.F.: Noncrossing trees and noncrossing graphs. Electron. J. Combin. 13, #N12 (2006)","DOI":"10.37236\/1150"},{"key":"1097_CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","volume":"31","author":"N. Dershowitz","year":"1980","unstructured":"Dershowitz N., Zaks S.: Enumerations of ordered trees. Discr. Math. 31, 9\u201328 (1980)","journal-title":"Discr. Math."},{"key":"1097_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0166-218X(89)90003-6","volume":"25","author":"N. Dershowitz","year":"1989","unstructured":"Dershowitz N., Zaks S.: Patterns in trees. Discr. Appl. Math. 25, 241\u2013255 (1989)","journal-title":"Discr. Appl. Math."},{"key":"1097_CR4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/jcta.1999.3027","volume":"90","author":"E. Deutsch","year":"2000","unstructured":"Deutsch E.: A bijection on ordered trees and its consequences. J. Combin. Theory Ser. A 90, 210\u2013215 (2000)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1097_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0012-365X(01)00366-1","volume":"254","author":"E. Deutsch","year":"2002","unstructured":"Deutsch E., Noy M.: Statistics on non-crossing trees. Discr. Math. 254, 75\u201387 (2002)","journal-title":"Discr. Math."},{"key":"1097_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0012-365X(98)00372-0","volume":"204","author":"P. Flajolet","year":"1999","unstructured":"Flajolet P., Noy M.: Analytic combinatorics of non-crossing configurations. Discr. Math. 204, 203\u2013229 (1999)","journal-title":"Discr. Math."},{"key":"1097_CR7","doi-asserted-by":"crossref","unstructured":"Hough, D.S.: Descents in noncrossing trees. Electron. J. Combin. 10, #N13 (2003)","DOI":"10.37236\/1753"},{"key":"1097_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0012-365X(97)00121-0","volume":"180","author":"M. Noy","year":"1998","unstructured":"Noy M.: Enumeration of noncrossing trees on a circle. Discr. Math. 180, 301\u2013313 (1998)","journal-title":"Discr. Math."},{"key":"1097_CR9","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. Discr. Math. 250, 181\u2013195 (2002)","journal-title":"Discr. Math."},{"key":"1097_CR10","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. Published electronically at http:\/\/www.research.att.com\/~njas\/sequences\/"},{"key":"1097_CR11","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative combinatorics, vol. 2. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511609589"},{"key":"1097_CR12","first-page":"79","volume":"11","author":"Y. Sun","year":"2009","unstructured":"Sun Y., Wang Z.: String pattern avoidance in generalized non-crossing trees. Discr. Math. Theor. Comput. Sci. 11, 79\u201394 (2009)","journal-title":"Discr. Math. Theor. Comput. Sci."},{"key":"1097_CR13","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00373-010-0950-9","volume":"26","author":"Y. Sun","year":"2010","unstructured":"Sun Y., Wang Z.: Consecutive pattern avoidances in non-crossing trees. Graphs Combin. 26, 815\u2013832 (2010)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1097-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1097-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1097-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,25]],"date-time":"2020-06-25T19:42:08Z","timestamp":1593114128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1097-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["1097"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1097-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,11]]}}}