{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:33:50Z","timestamp":1648564430325},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0012-365x(78)90085-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"129-136","source":"Crossref","is-referenced-by-count":0,"title":["A linear algorithm for disjoint matchings in trees"],"prefix":"10.1016","volume":"21","author":[{"given":"E.J.","family":"Cockayne","sequence":"first","affiliation":[]},{"given":"B.L.","family":"Hartnell","sequence":"additional","affiliation":[]},{"given":"S.T.","family":"Hedetniemi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90085-7_BIB1","first-page":"329","article-title":"Which trees do not have disjoint matchings","volume":"9","author":"Cockayne","year":"1976","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(78)90085-7_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1 vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0012-365X(78)90085-7_BIB3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0205009","article-title":"b-matchings in trees","volume":"5","author":"Goodman","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(78)90085-7_BIB4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230040207","article-title":"Matchings in polytopal graphs","volume":"4","author":"Gr\u00fcnbaum","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0012-365X(78)90085-7_BIB5","unstructured":"B.L. Hartnell, On unicyclic graphs having two disjoint maximal matchings (submitted)."},{"key":"10.1016\/0012-365X(78)90085-7_BIB6","series-title":"Conference Record 1971 Twelfth Annual Symposium on Switching and Automata Theory","article-title":"A N12 algorithm for maximum matchings in bipartite graphs","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0012-365X(78)90085-7_BIB7","series-title":"Ph.D. Thesis","article-title":"Algorithms on trees and maximal outer planar graphs: Design, complexity analysis, and data structures study","author":"Mitchell","year":"1976"},{"key":"10.1016\/0012-365X(78)90085-7_BIB8","series-title":"New Directions in the Theory of Graphs","first-page":"275","article-title":"Almost all trees are cospectral","author":"Schwenk","year":"1973"},{"key":"10.1016\/0012-365X(78)90085-7_BIB9","unstructured":"P.J. Slater, A Constructive characterization of trees having k disjoint maximum matchings (submitted)."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78900857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:12Z","timestamp":1555154412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78900857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78900857"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90085-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}