{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:27:49Z","timestamp":1757615269344,"version":"3.44.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2002,4,9]],"date-time":"2002-04-09T00:00:00Z","timestamp":1018310400000},"content-version":"vor","delay-in-days":2930,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/0012-365x(94)90132-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"401-405","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Maximality of the cycle code of a graph"],"prefix":"10.1016","volume":"128","author":[{"given":"Patrick","family":"Sol\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Zaslavsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1976","series-title":"Graph Theory with Applications","author":"Bondy","key":"10.1016\/0012-365X(94)90132-5_BIB1"},{"key":"10.1016\/0012-365X(94)90132-5_BIB2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TIT.1985.1057043","article-title":"Covering radius\u2013survey and recent results","volume":"31","author":"Cohen","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(94)90132-5_BIB3","unstructured":"A. Frank, Conservative weightings and ear-decompositions of graphs, Combinatorica, submitted."},{"key":"10.1016\/0012-365X(94)90132-5_BIB4","series-title":"IEEE Region Six Conf. Record Comm.","first-page":"635","article-title":"Recent progress and new problems in applied graph theory, Vol. 2","author":"Hakimi","year":"1966"},{"key":"10.1016\/0012-365X(94)90132-5_BIB5","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/TIT.1968.1054190","article-title":"Graph theoretic error-correcting codes","volume":"14","author":"Hakimi","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0012-365X(94)90132-5_BIB6","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0012-365X(94)90132-5_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(93)90140-J","article-title":"The covering radius of the cycle code of a graph","volume":"45","author":"Sol\u00e9","year":"1993","journal-title":"Discrete Appl. Math"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901325?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901325?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T13:34:39Z","timestamp":1757079279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0012365X94901325"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90132-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1994,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximality of the cycle code of a graph","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0012-365X(94)90132-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}