{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:13:29Z","timestamp":1774044809116,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":10821,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0095-8956(83)90056-4","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:34:55Z","timestamp":1103679295000},"page":"297-308","source":"Crossref","is-referenced-by-count":80,"title":["Shortest coverings of graphs with cycles"],"prefix":"10.1016","volume":"35","author":[{"given":"Jean Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Jaeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(83)90056-4_BIB1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colorable","volume":"21","author":"Appel","year":"1977","journal-title":"Illinois J. Math"},{"key":"10.1016\/0095-8956(83)90056-4_BIB2","author":"Berge","year":"1971"},{"key":"10.1016\/0095-8956(83)90056-4_BIB3","author":"Bondy","year":"1976"},{"key":"10.1016\/0095-8956(83)90056-4_BIB4","unstructured":"U. Celmins, \u201cOn Conjectures Relating to Snarks\u201d, Ph. D. thesis, Waterloo, to appear."},{"key":"10.1016\/0095-8956(83)90056-4_BIB5","first-page":"204","article-title":"Minimally 2-connected graphs","volume":"228","author":"Dirac","year":"1967","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0095-8956(83)90056-4_BIB6","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\/0095-8956(83)90056-4_BIB7","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler-Tours, and the Chinese Postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0095-8956(83)90056-4_BIB8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01387754","article-title":"Eine gemeinsame Basis f\u00fcr die Theorie der Eulerschen Graphen und den Satz von Petersen","volume":"81","author":"Fleischner","year":"1976","journal-title":"Monash. Math."},{"key":"10.1016\/0095-8956(83)90056-4_BIB9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0095-8956(80)90077-5","article-title":"Eulersche Linien und Kreis\u00fcberdeckungen, die vorgegebene Durchg\u00e4nge in den Knoten vermeiden","volume":"29","author":"Fleischner","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(83)90056-4_BIB10","unstructured":"H. Fleischner and G. Meigu, On the cycle covering problem for planar graphs, to be submitted."},{"issue":"4","key":"10.1016\/0095-8956(83)90056-4_BIB11","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1137\/0210058","article-title":"Covering Graphs by Simple Circuits","volume":"10","author":"Itai","year":"1981","journal-title":"Siam J. Comput"},{"key":"10.1016\/0095-8956(83)90056-4_BIB12","series-title":"Automata, Languages, and Programming","first-page":"289","article-title":"Covering a graph by circuits","author":"Itai","year":"1978"},{"key":"10.1016\/0095-8956(83)90056-4_BIB13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0095-8956(79)90057-1","article-title":"Flows and generalized coloring theorems in graphs","volume":"26","author":"Jaeger","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(83)90056-4_BIB14","series-title":"Advances in Graph Theory","first-page":"145","article-title":"A reduction method for edge-connectivity in graphs","author":"Mader","year":"1978"},{"key":"10.1016\/0095-8956(83)90056-4_BIB15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","article-title":"On minimal blocks","volume":"134","author":"Plummer","year":"1968","journal-title":"Trans Amer. Math. Soc."},{"key":"10.1016\/0095-8956(83)90056-4_BIB16","article-title":"Sur les colorations des ar\u00eates des graphes cubiques","author":"Preissmann","year":"1981","journal-title":"Th\u00e8se de Doctorat de 3\u00e8me cycle"},{"key":"10.1016\/0095-8956(83)90056-4_BIB17","series-title":"Graph Theory and Related Topics","first-page":"341","article-title":"Sums of circuits","author":"Seymour","year":"1979"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895683900564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895683900564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T21:41:57Z","timestamp":1586036517000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895683900564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0095895683900564"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(83)90056-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}