{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:51:25Z","timestamp":1772358685570,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5645,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0012-365x(97)00121-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"301-313","source":"Crossref","is-referenced-by-count":31,"title":["Enumeration of noncrossing trees on a circle"],"prefix":"10.1016","volume":"180","author":[{"given":"Marc","family":"Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00121-0_bib1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","article-title":"Asymptotic methods in enumeration","volume":"16","author":"Bender","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/S0012-365X(97)00121-0_bib2","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/S0012-365X(97)00121-0_bib3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0012-365X(74)90081-8","article-title":"Enumeration of Ladder Graphs","volume":"9","author":"Domb","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00121-0_bib4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(93)90326-O","article-title":"Cordes, arbres et permutations","volume":"117","author":"Dulucq","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00121-0_bib5","unstructured":"Ph. Flajolet, personal communication."},{"key":"10.1016\/S0012-365X(97)00121-0_bib6","series-title":"Proc. 7th Canadian Conf. on Computational Geometry","first-page":"97","article-title":"Lower bounds for the number of crossing-free subgraphs of Kn","author":"Garc\u00eda","year":"1995"},{"key":"10.1016\/S0012-365X(97)00121-0_bib7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/BF03024089","article-title":"Catalan numbers, their generalization and their uses","volume":"13","author":"Hilton","year":"1991","journal-title":"Math. Intelligencer"},{"key":"10.1016\/S0012-365X(97)00121-0_bib8","article-title":"Counting labelled trees","author":"Moon","year":"1970"},{"key":"10.1016\/S0012-365X(97)00121-0_bib9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.4153\/CMB-1963-017-0","article-title":"Triangular dissections of n-gons","volume":"6","author":"Moon","year":"1963","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00121-0_bib10","series-title":"Proc. 7th Formal Power Series and Algebraic Combinatorics","first-page":"465","article-title":"Enumeration of non-crossing trees","author":"Noy","year":"1995"},{"key":"10.1016\/S0012-365X(97)00121-0_bib11","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/0403050","article-title":"On the number of distinct forests","volume":"3","author":"Tak\u00e1cs","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(97)00121-0_bib12","first-page":"131","article-title":"A proof of Kirkman's hypothesis","volume":"13","author":"Watson","year":"1962-1963"},{"key":"10.1016\/S0012-365X(97)00121-0_bib13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0747-7171(08)80044-2","article-title":"The Method of creative telescoping","volume":"11","author":"Zeilberger","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0012-365X(97)00121-0_bib14","article-title":"Analytic combinatorics of non-crossing configurations","author":"Flajolet","year":"1997","journal-title":"INRiA Research Report 3196"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001210?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97001210?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:18Z","timestamp":1556131878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97001210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0012365X97001210"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00121-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}