{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:19:14Z","timestamp":1772749154892,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,5,1]],"date-time":"1979-05-01T00:00:00Z","timestamp":294364800000},"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":12496,"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":[[1979,5]]},"DOI":"10.1016\/0097-3165(79)90108-0","type":"journal-article","created":{"date-parts":[[2004,8,28]],"date-time":"2004-08-28T02:52:48Z","timestamp":1093661568000},"page":"308-313","source":"Crossref","is-referenced-by-count":24,"title":["Depth-first search as a combinatorial correspondence"],"prefix":"10.1016","volume":"26","author":[{"given":"Ira","family":"Gessel","sequence":"first","affiliation":[]},{"given":"Da-Lun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(79)90108-0_BIB1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1512\/iumj.1971.20.20060","article-title":"Enumerative uses of generating functions","volume":"20","author":"Bender","year":"1971","journal-title":"Indiana Univ. Math. J."},{"key":"10.1016\/0097-3165(79)90108-0_BIB2","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1090\/S0002-9904-1968-11888-9","article-title":"The inversion enumerator for labelled trees","volume":"74","author":"Mallows","year":"1968","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0097-3165(79)90108-0_BIB3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.4153\/CJM-1956-046-2","article-title":"Enumeration of labelled graphs","volume":"8","author":"Gilbert","year":"1956","journal-title":"Canad. J. Math."},{"issue":"No. 1","key":"10.1016\/0097-3165(79)90108-0_BIB4","first-page":"242","article-title":"On a recurrence method of counting graphs with labelled vertices","volume":"10","author":"Liskovec","year":"1969","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0097-3165(79)90108-0_BIB5","author":"Aho","year":"1974"},{"key":"10.1016\/0097-3165(79)90108-0_BIB6","article-title":"La S\u00e9rie G\u00e9n\u00e9ratrice Exponentielle dans les Probl\u00e8mes d'\u00c9num\u00e9ration","author":"Foata","year":"1974"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316579901080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316579901080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T12:26:09Z","timestamp":1549283169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316579901080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,5]]}},"alternative-id":["0097316579901080"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(79)90108-0","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1979,5]]}}}