{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:54:26Z","timestamp":1648868066437},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf01261319","type":"journal-article","created":{"date-parts":[[2005,3,23]],"date-time":"2005-03-23T22:01:48Z","timestamp":1111615308000},"page":"331-341","source":"Crossref","is-referenced-by-count":1,"title":["Bounding the number of circuits of a graph"],"prefix":"10.1007","volume":"16","author":[{"given":"Guoli","family":"Ding","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230190206","volume":"19","author":"E. Balas","year":"1989","unstructured":"E. Balas, andC.S. Yu: On graphs with polynomially solvable maximum-weight clique problem,Networks,19 (1989), 247?253.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially ordered sets,Ann. Math. 51 (1950), 161?166.","journal-title":"Ann. Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230250405","volume":"25","author":"G. Ding","year":"1995","unstructured":"G. Ding: Graphs with not too many spanning trees,Networks,25 (1995), 193?197.","journal-title":"Networks"},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01200752","volume":"15","author":"G. Ding","year":"1995","unstructured":"G. Ding Bounding the number of bases of a matroid,Combinatorica,15 (2) (1995), 159?165.","journal-title":"Combinatorica"},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1006\/jctb.1996.0002","volume":"66","author":"G. Ding","year":"1996","unstructured":"G. Ding: Excluding a long double path minor,J. Combinatorial Theory (B),66, (1) (1996), 11?23.","journal-title":"J. Combinatorial Theory (B)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261319.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01261319\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01261319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:08:44Z","timestamp":1556795324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01261319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF01261319"],"URL":"https:\/\/doi.org\/10.1007\/bf01261319","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}