{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:52:36Z","timestamp":1726447956567},"reference-count":4,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0012-365x(84)90038-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"107-108","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Transversals of circuits and acyclic orientations in graphs and matroids"],"prefix":"10.1016","volume":"50","author":[{"given":"C.","family":"Berge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Las Vergnas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(84)90038-4_BIB1","article-title":"Sur le nombre minimum d'arcs \u00e0 inverser pour rendre un graphe fortement connexe","volume":"25","author":"Berge","year":"1983","journal-title":"Cahiers du C.E.R.O."},{"key":"10.1016\/0012-365X(84)90038-4_BIB2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(78)90080-1","article-title":"Orientability of matroids","volume":"24","author":"Bland","year":"1978","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"10.1016\/0012-365X(84)90038-4_BIB3_1","first-page":"65","article-title":"Some properties of graphs containing circuits","author":"Dambit","year":"1965","journal-title":"Latv. Mat. Ezh."},{"year":"1970","series-title":"Graphes et Hypergraphes","author":"Berge","key":"10.1016\/0012-365X(84)90038-4_BIB3_2"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84900384?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X84900384?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T14:51:04Z","timestamp":1553179864000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X84900384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":4,"alternative-id":["0012365X84900384"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(84)90038-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1984]]}}}