{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T10:04:10Z","timestamp":1751882650005},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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":[[1990,10]]},"DOI":"10.1016\/0012-365x(90)90139-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"323-326","source":"Crossref","is-referenced-by-count":3,"title":["Counting forests"],"prefix":"10.1016","volume":"84","author":[{"given":"Lajos","family":"Tak\u00e1cs","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(90)90139-9_BIB1","first-page":"369","article-title":"Solution d'un probl\u00e8me","volume":"105","author":"Bertrand","year":"1887","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(90)90139-9_BIB2","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BF02948945","article-title":"\u00dcber eine kombinatorische Frage","volume":"12","author":"Bol","year":"1938","journal-title":"Abh. math. Sem. Hansischen Univ."},{"key":"10.1016\/0012-365X(90)90139-9_BIB3_1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley","year":"1889","journal-title":"Quart. J. Pure Appl. Math."},{"key":"10.1016\/0012-365X(90)90139-9_BIB3_2","first-page":"26","volume":"Vol. XIII","author":"Cayley","year":"1897"},{"key":"10.1016\/0012-365X(90)90139-9_BIB4","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1112\/jlms\/s1-33.4.471","article-title":"On Cayley's formula for counting trees","volume":"33","author":"Clarke","year":"1958","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(90)90139-9_BIB5","first-page":"64","article-title":"Eine Formel der Substitutionstheorie","volume":"17","author":"Dziobek","year":"1917","journal-title":"Sitzungsber. Berliner Math. Gesellschaft"},{"key":"10.1016\/0012-365X(90)90139-9_BIB6","series-title":"Random Mappings","first-page":"150","author":"Kolchin","year":"1986"},{"key":"10.1016\/0012-365X(90)90139-9_BIB7","series-title":"A Seminar on Graph Theory","first-page":"70","article-title":"Various proofs of Cayley's formula for counting trees","author":"Moon","year":"1967"},{"key":"10.1016\/0012-365X(90)90139-9_BIB8","doi-asserted-by":"crossref","first-page":"846","DOI":"10.2307\/2312668","article-title":"Another proof of Cayley's formula for counting trees","volume":"70","author":"Moon","year":"1968","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(90)90139-9_BIB9","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1214\/aoms\/1177698524","article-title":"A tree counting problem","volume":"39","author":"Moon","year":"1968","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0012-365X(90)90139-9_BIB10","first-page":"26","article-title":"Counting Labelled Trees","author":"Moon","year":"1970","journal-title":"Canadian Mathematical Congress"},{"key":"10.1016\/0012-365X(90)90139-9_BIB11","first-page":"142","article-title":"Neuer Beweis eines Satzes \u00fcber Permutationen","volume":"27","author":"Prűfer","year":"1918","journal-title":"Arch. Math Physik"},{"key":"10.1016\/0012-365X(90)90139-9_BIB12","first-page":"73","article-title":"Some remarks on the theory of trees","volume":"4","author":"R\u00e9nyi","year":"1959","journal-title":"Publ. Math. Inst. Hungarian Acad. Sci."},{"key":"10.1016\/0012-365X(90)90139-9_BIB13","series-title":"Combinatorial Structures and their Applications","first-page":"355","article-title":"On the enumeration of trees","author":"R\u00e9nyi","year":"1970"},{"key":"10.1016\/0012-365X(90)90139-9_BIB14","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/S0021-9800(68)80033-X","article-title":"Forests of labeled trees","volume":"5","author":"Riordan","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(90)90139-9_BIB15","series-title":"Combinatorial Methods of Discrete Mathematics","first-page":"181","author":"Sachkov","year":"1977"},{"key":"10.1016\/0012-365X(90)90139-9_BIB16","first-page":"327","article-title":"A generalization of the ballot problem and its application in the theory of queues","volume":"57","author":"Tak\u00e1cs","year":"1962","journal-title":"J. Amer. Statist. Assoc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90901399?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X90901399?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:09Z","timestamp":1555120509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X90901399"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0012365X90901399"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(90)90139-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}