{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T06:40:43Z","timestamp":1778654443517,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0095-8956(03)00078-9","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T12:35:01Z","timestamp":1060691701000},"page":"107-120","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":23,"title":["Edge-disjoint odd cycles in planar graphs"],"prefix":"10.1016","volume":"90","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Heinz-J\u00fcrgen","family":"Voss","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00078-9_BIB1","unstructured":"S. Brandt, L\u00f6sung zu Problem 66, in: Mathematische Semesterberichte, Vol. 44, Springer, Berlin, 1997, pp. 95\u201396."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0012-365X(99)00283-6","article-title":"Optimal packings of edge-disjoint odd cycles","volume":"211","author":"Berge","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB3","series-title":"Combinatorial Optimization, Wiley Interscience Series in Discrete Mathematics and Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","article-title":"On independent circuits contained in a graph","volume":"17","author":"Erd\u0151s","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. Festa, P.M. Pardalos, M.G.C. Resende, Feedback set problems, in: D.Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 4, Kluwer Academic Publishers, Dordrecht, 1999, pp. 209\u2013258.","DOI":"10.1007\/978-1-4757-3023-4_4"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(93)00228-W","article-title":"On a conjecture of Tuza about packing and covering of triangles","volume":"142","author":"Krivelevich","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930100024","article-title":"The Erd\u0151s-P\u00f3sa property for odd cycles in highly connected graphs","volume":"21","author":"Rautenbach","year":"2001","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S0095-8956(03)00078-9_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930050056","article-title":"Mangoes, blueberries","volume":"19","author":"Reed","year":"1999","journal-title":"Combinatorica"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jctb.1997.1750","article-title":"The four-colour theorem","volume":"70","author":"Robertson","year":"1999","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB11","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB12","doi-asserted-by":"crossref","unstructured":"P.D. Seymour, On odd cuts and plane multicommodity flows, Proc. London Math. Soc. (1981), 178\u2013192.","DOI":"10.1112\/plms\/s3-42.1.178"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02020974","article-title":"A new proof and generalizations of a theorem of Erd\u0151s and P\u00f3sa on graphs without k+1 independent circuits","volume":"18","author":"Simonovits","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB14","unstructured":"C. Thomassen, The Erd\u0151s-P\u00f3sa property for odd cycles in graphs of large connectivity, MAT-report no. 1999-08, Technical University of Denmark."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01787705","article-title":"A conjecture on triangles of graphs","volume":"6","author":"Tuza","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB16","unstructured":"H.-J. Voss, Some properties of graphs containing k independent circuits, in: Proceedings of the Coll. Tihany, Publ. House Hung. Acad. Sci., Budapest, 1966, Academic Press, New York, 1968, pp. 321\u2013334."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB17","series-title":"Cycles and bridges in graphs","volume":"Vol. 49","author":"Voss","year":"1991"},{"key":"10.1016\/S0095-8956(03)00078-9_BIB18","unstructured":"H.-J. Voss, H. Walther, \u00dcber Kreise in Graphen (in German), Deutscher Verlag der Wissenschaften, 1972."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB19","unstructured":"D. West (Ed.), Open Problems Column #14 of SIAM Activity Group Newsletter in Discrete Mathematics, Spring 1994."},{"key":"10.1016\/S0095-8956(03)00078-9_BIB20","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, Node and edge-deletion NP-complete problems, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, 1978, pp. 296\u2013313.","DOI":"10.1145\/800133.804355"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000789?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000789?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:00:40Z","timestamp":1758816040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0095895603000789"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00078-9","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-disjoint odd cycles in planar graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0095-8956(03)00078-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}