{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T01:00:09Z","timestamp":1720054809387},"reference-count":3,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90125-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"633-636","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["A note on covering the edges of a graph with bonds"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Victor","family":"Neumann-Lara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Rivera-Campo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90125-5_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1981"},{"key":"10.1016\/S0012-365X(99)90125-5_BIB2","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.4153\/CJM-1966-129-2","article-title":"Connectivity in matroids","volume":"18","author":"Tutte","year":"1966","journal-title":"Can. J. Math."},{"key":"10.1016\/S0012-365X(99)90125-5_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1017\/S0963548396002787","article-title":"An upper bound on the number of edges of a 2-connected graph","volume":"6","author":"Wu","year":"1997","journal-title":"Combin. Probab. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:21:52Z","timestamp":1553214112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99901255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":3,"alternative-id":["S0012365X99901255"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90125-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}