{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:18:52Z","timestamp":1649017132240},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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":13712,"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":[[1976]]},"DOI":"10.1016\/0012-365x(76)90049-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"359-371","source":"Crossref","is-referenced-by-count":2,"title":["On the number of complementary trees in a graph"],"prefix":"10.1016","volume":"15","author":[{"given":"Uriel G.","family":"Rothblum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(76)90049-2_BIB1","series-title":"Technical Report","article-title":"On bounds for complementary trees in a graph","author":"Adler","year":"1969"},{"key":"10.1016\/0012-365X(76)90049-2_BIB2","author":"Chv\u00e1tal","year":"1971","journal-title":"Private communication to G.B. Dantzig"},{"key":"10.1016\/0012-365X(76)90049-2_BIB3","series-title":"Integer and Nonlinear Programming","first-page":"449","article-title":"Complementary spanning trees","author":"Dantzig","year":"1970"},{"issue":"1","key":"10.1016\/0012-365X(76)90049-2_BIB4","doi-asserted-by":"crossref","DOI":"10.1002\/sapm197453157","article-title":"Complementary trees and independent matchings","volume":"53","author":"Greene","year":"1974","journal-title":"Studies in Appl. Math."},{"issue":"3","key":"10.1016\/0012-365X(76)90049-2_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/sapm1972513309","article-title":"Finding uncomplemented trees","volume":"51","author":"Kleitman","year":"1972","journal-title":"Studies in Appl. Math."},{"key":"10.1016\/0012-365X(76)90049-2_BIB6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0012-365X(74)90155-1","article-title":"Complementary bases of \u03b5 matroid","volume":"8","author":"Magnanti","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(76)90049-2_BIB7","series-title":"Technical Report","article-title":"On the number of complementary trees in a graph","author":"Rothblum","year":"1973"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X76900492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X76900492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:56:07Z","timestamp":1555138567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X76900492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976]]}},"alternative-id":["0012365X76900492"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(76)90049-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}