{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T14:26:34Z","timestamp":1773239194938,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/0012-365x(95)00119-h","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"253-258","source":"Crossref","is-referenced-by-count":15,"title":["Counting acyclic digraphs by sources and sinks"],"prefix":"10.1016","volume":"160","author":[{"given":"Ira M.","family":"Gessel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00119-H_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(91)90078-B","article-title":"Computation of the expected number of leaves in a tree having a given automorphism, and related topics","volume":"34","author":"Bergeron","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(95)00119-H_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0097-3165(93)90098-S","article-title":"q-\u00c9numeration de polyominos convexes","volume":"64","author":"Bousquet-M\u00e9lou","year":"1993","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0012-365X(95)00119-H_BIB3","article-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangement","volume":"vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/0012-365X(95)00119-H_BIB4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0001-8708(79)90049-5","article-title":"A noncommutative version of the matrix inversion formula","volume":"31","author":"Foata","year":"1979","journal-title":"Adv. Math."},{"key":"10.1016\/0012-365X(95)00119-H_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(94)00135-6","article-title":"Enumerative applications of a decomposition for graphs and digraphs","volume":"139","author":"Gessel","year":"1995","journal-title":"Discrete Math."},{"issue":"No. 2","key":"10.1016\/0012-365X(95)00119-H_BIB6","doi-asserted-by":"crossref","first-page":"R9","DOI":"10.37236\/1267","article-title":"The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions","volume":"3","author":"Gessel","year":"1996","journal-title":"Electronic J. Combinatorics"},{"key":"10.1016\/0012-365X(95)00119-H_BIB7","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/1120047","article-title":"On the number of maximal vertices of a random acyclic digraph","volume":"20","author":"Liskovets","year":"1975","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/0012-365X(95)00119-H_BIB8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/S0021-9800(69)80119-5","article-title":"The number of labeled k-trees","volume":"6","author":"Moon","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(95)00119-H_BIB9","series-title":"New Directions in the Theory of Graphs","first-page":"239","article-title":"Counting labeled acyclic digraphs","author":"Robinson","year":"1971"},{"key":"10.1016\/0012-365X(95)00119-H_BIB10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(92)90155-9","article-title":"On the number of labeled acyclic digraphs","volume":"105","author":"Rodionov","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00119-H_BIB11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(73)90108-8","article-title":"Acyclic orientations of graphs","volume":"5","author":"Stanley","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(95)00119-H_BIB12","series-title":"Combinatoire \u00c9numerative, Proceedings","first-page":"321","article-title":"Heaps of pieces, I: basic definitions and combinatorial lemmas","volume":"vol. 1234","author":"Viennot","year":"1986"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500119H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500119H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T06:44:31Z","timestamp":1620629071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500119H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["0012365X9500119H"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00119-h","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}