{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:00:04Z","timestamp":1767855604133,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"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":9939,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1016\/0097-3165(86)90004-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T04:49:18Z","timestamp":1108010958000},"page":"15-30","source":"Crossref","is-referenced-by-count":35,"title":["Bijections for Cayley trees, spanning trees, and their q-analogues"],"prefix":"10.1016","volume":"42","author":[{"given":"\u00d6mer","family":"E\u01e7ecio\u01e7lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B","family":"Remmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(86)90004-X_BIB1_1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley","year":"1889","journal-title":"Quart. J. Math."},{"key":"10.1016\/0097-3165(86)90004-X_BIB1_2","first-page":"26","volume":"13","author":"Cayley","year":"1897","journal-title":"Collected Papers"},{"key":"10.1016\/0097-3165(86)90004-X_BIB2","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\/0097-3165(86)90004-X_BIB3","first-page":"742","article-title":"Never Beweis eines Satzes \u00fcber Permutationen","volume":"27","author":"Pr\u00fcfer","year":"1918","journal-title":"Arch. Math. Phys. Sci."},{"key":"10.1016\/0097-3165(86)90004-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0001-8708(81)90052-9","article-title":"Une Th\u00e9orie combinatoire des s\u00e9ries formelles","volume":"42","author":"Joyal","year":"1981","journal-title":"Advan. in Math."},{"key":"10.1016\/0097-3165(86)90004-X_BIB5","unstructured":"A. Garsia and \u00d6. E\u01e7ecio\u01e7lu, \u201cCombinatorial Foundations of Computer Science,\u201d in preparation."},{"key":"10.1016\/0097-3165(86)90004-X_BIB6","series-title":"Higher Combinatorics","first-page":"27","article-title":"Distributions Euleriennes et Mahoniennes sur le groupe des permutations","author":"Foata","year":"1977"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731658690004X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009731658690004X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T08:51:02Z","timestamp":1548751862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009731658690004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["009731658690004X"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(86)90004-x","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}