{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T05:25:59Z","timestamp":1767245159824},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"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,10]]},"DOI":"10.1016\/0012-365x(95)00037-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:55Z","timestamp":1027608955000},"page":"63-75","source":"Crossref","is-referenced-by-count":4,"title":["Series-parallel posets and the Tutte polynomial"],"prefix":"10.1016","volume":"158","author":[{"given":"Gary","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00037-W_BIB1","series-title":"Matroid Applications","first-page":"284","article-title":"Introduction to Greedoids","volume":"Vol. 40","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/0012-365X(95)00037-W_BIB2","series-title":"Matroid Applications","first-page":"123","article-title":"The Tutte polynomial and its applications","volume":"Vol. 40","author":"Brylawski","year":"1992"},{"key":"10.1016\/0012-365X(95)00037-W_BIB3","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/jgt.3190150308","article-title":"Tutte polynomials for trees","volume":"15","author":"Chaudhary","year":"1991","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00037-W_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01294456","article-title":"The complexity of computing the Tutte polynomial on transversal matroids","volume":"15","author":"Colbourn","year":"1995","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(95)00037-W_BIB5","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/0215077","article-title":"Searching in trees, series-parallel and interval orders","volume":"15","author":"Faigle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00037-W_BIB6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jctb.1993.1060","article-title":"A Tutte polynomial for partially ordered sets","volume":"59","author":"Gordon","year":"1993","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0012-365X(95)00037-W_BIB7","first-page":"287","article-title":"A greedoid polynomial which distinguishes rooted aborescences","volume":"107","author":"Gordon","year":"1989"},{"key":"10.1016\/0012-365X(95)00037-W_BIB8","first-page":"35","article-title":"On the computational complexity of the Jones and Tutte polynomials","volume":"108","author":"Jaeger","year":"1990"},{"key":"10.1016\/0012-365X(95)00037-W_BIB9","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/jgt.3190170316","article-title":"On the greedoid polynomial for rooted graphs and rooted digraphs","volume":"17","author":"McMahon","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00037-W_BIB10","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","article-title":"The complexity of counting cuts and of computing the probability that a graph is connected","volume":"12","author":"Provan","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00037-W_BIB11","series-title":"Ordered Sets","year":"1982"},{"key":"10.1016\/0012-365X(95)00037-W_BIB12","first-page":"295","article-title":"Enumeration of posets generated by disjoint unions and ordinal sums","volume":"45","author":"Stanley","year":"1974"},{"key":"10.1016\/0012-365X(95)00037-W_BIB13","volume":"Vol. 1","author":"Stanley","year":"1986"},{"key":"10.1016\/0012-365X(95)00037-W_BIB14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(95)00037-W_BIB15","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500037W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9500037W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:28:33Z","timestamp":1556396913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9500037W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0012365X9500037W"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00037-w","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}