{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T09:51:32Z","timestamp":1772358692479,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01202790","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:51:34Z","timestamp":1108741894000},"page":"65-81","source":"Crossref","is-referenced-by-count":42,"title":["Conservative weightings and ear-decompositions of graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Andr\ufffds","family":"Frank","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Paths, trees, and flowers,Canad. J. Math. 17 (1965), 449?467.","journal-title":"Canad. J. Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds andE. Johnson: Matching, Euler tour and the Chinese postman,Mathematical Programming 5 (1973) 88?124.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121011","volume":"22","author":"A. Frank","year":"1984","unstructured":"A. Frank, A. Seb? and\ufffd. Tardos: Covering directed and odd cuts,Mathematical Programming Studies 22 (1984) 99?112.","journal-title":"Mathematical Programming Studies"},{"key":"CR4","first-page":"135","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Neuer Beweis eines Tutteschen Satze,Magyar Tud. Akad. Mat. Kut. Int. K\ufffdzl. 8 (1963), 135?139.","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\ufffdzl."},{"key":"CR5","first-page":"273","volume":"1","author":"Mei-Gu Guan","year":"1962","unstructured":"Mei-Gu Guan: Graphic programming using odd or even points,Chinese Mathematics 1 (1962), 273?277.","journal-title":"Chinese Mathematics"},{"key":"CR6","first-page":"351","volume":"8","author":"G. Hetyei","year":"1964","unstructured":"G. Hetyei: Rectangular configurations which can be covered by 2\ufffd1 rectangles,P\ufffdcsi Tan. F?isk. K\ufffdzl. 8, (1964), 351?367 (in Hungarian).","journal-title":"P\ufffdcsi Tan. F?isk. K\ufffdzl."},{"key":"CR7","first-page":"279","volume":"7","author":"L. Lov\ufffdsz","year":"1972","unstructured":"L. Lov\ufffdsz: A note on factor-critical graphs,Studia Sci. Math. Hung. 7 (1972), 279?280.","journal-title":"Studia Sci. Math. Hung."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01902352","volume":"26","author":"L. Lov\ufffdsz","year":"1975","unstructured":"L. Lov\ufffdsz: 2-matchings and 2-covers of hypergraphs,Acta Mat. Acad. Sci. Hungar. 26 (1975) 433?444.","journal-title":"Acta Mat. Acad. Sci. Hungar."},{"key":"CR9","unstructured":"L. Lov\ufffdsz, M. Plummer:Maching Theory, Akad\ufffdmiai Kiad\ufffd Budapest and North-Holland Publishing Company, 1986."},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C. L. Lucchesi","year":"1978","unstructured":"C. L. Lucchesi andD. H. Younger: A minimax relation for directed graphs,J. London Math. Soc. (2)17 (1978), 369?374.","journal-title":"J. London Math. Soc."},{"key":"CR11","unstructured":"F. J. MacWilliams andN. J. A. Sloane:The theory of error correcting codes, North-Holland, 1977."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(87)90246-9","volume":"64","author":"A. Seb?","year":"1987","unstructured":"A. Seb?: A quick proof of Seymour's theorem on T-joins,Discrete Mathematics 64 (1987), 101?103.","journal-title":"Discrete Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"A. Seb?: Undirected distances and the postman structure of graphs,J. Combinatorial Theory, Ser. B, Vol. 49, No. 1, June 1990.","DOI":"10.1016\/0095-8956(90)90062-5"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"42","author":"P. D. Seymour","year":"1981","unstructured":"P. D. Seymour: On odd cuts and plane multicommodity flows,Proceedings of the London Math. Soc. 42 (1981) 178?192.","journal-title":"Proceedings of the London Math. Soc."},{"key":"CR15","unstructured":"P. Sol\ufffd, Th. Zaslavsky: Covering radius, maximality and decoding of the cycle code of a graph,Discrete Mathematics, to appear."},{"key":"CR16","unstructured":"D. Welsh: Oral communication."},{"key":"CR17","unstructured":"A. S. Fraenkel andM. Loebl: Complexity of circuit intersection in graphs, preprint (1991)."},{"key":"CR18","unstructured":"A. Frank, T. Jord\ufffdn andZ. Szigeti: On strongly conservative weightings, in preparation."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202790.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202790\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:13:59Z","timestamp":1586121239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01202790"],"URL":"https:\/\/doi.org\/10.1007\/bf01202790","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}