{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T15:08:13Z","timestamp":1745334493209},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9440-0","type":"journal-article","created":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T20:00:27Z","timestamp":1324065627000},"page":"127-134","source":"Crossref","is-referenced-by-count":3,"title":["Approximate min-max relations on plane graphs"],"prefix":"10.1007","volume":"26","author":[{"given":"Jie","family":"Ma","sequence":"first","affiliation":[]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Wenan","family":"Zang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,17]]},"reference":[{"key":"9440_CR1","first-page":"357","volume-title":"Graph theory and related topics","author":"M Albertson","year":"1979","unstructured":"Albertson M, Berman D (1979) A conjecture on planar graphs. In: Bondy JA, Murty USR (eds) Graph theory and related topics. Academic Press, San Diego, p 357"},{"key":"9440_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, Berlin"},{"key":"9440_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","volume":"9","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s P, P\u00f3sa L (1962) On the maximal number of disjoint circuits of a graph. Publ Math Debrecen 9:3\u201312","journal-title":"Publ Math Debrecen"},{"key":"9440_CR4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1965-035-8","volume":"17","author":"P Erd\u0151s","year":"1965","unstructured":"Erd\u0151s P, P\u00f3sa L (1965) On independent circuits contained in a graph. Canad J Math 17:347\u2013352","journal-title":"Canad J Math"},{"key":"9440_CR5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-006-0063-7","volume":"110","author":"S Fiorini","year":"2007","unstructured":"Fiorini S, Hardy N, Reed B, Vetta A (2007) Approximate min-max relations for odd cycles in planar graphs. Math Program Ser B 110:71\u201391","journal-title":"Math Program Ser B"},{"key":"9440_CR6","first-page":"282","volume-title":"Lecture notes in comput sci","author":"T Kloks","year":"2002","unstructured":"Kloks T, Lee CM, Liu J (2002) New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In: Lecture notes in comput sci, vol\u00a02573, pp 282\u2013295"},{"key":"9440_CR7","unstructured":"Kloks T, Lee CM, Liu J (2007) Jones\u2019 conjecture. Open Problems Garden (see: http:\/\/garden.irmacs.sfu.ca\/?q=category\/graph_theory )"},{"key":"9440_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0095-8956(03)00078-9","volume":"90","author":"D Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l D, Voss H-J (2004) Edge-disjoint odd cycles in planar graphs. J\u00a0Combin Theory Ser B 90:107\u2013120","journal-title":"J\u00a0Combin Theory Ser B"},{"key":"9440_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C Lucchesi","year":"1978","unstructured":"Lucchesi C, Younger D (1978) A\u00a0minimax theorem for directed graphs. J\u00a0London Math Soc 17:369\u2013374","journal-title":"J\u00a0London Math Soc"},{"key":"9440_CR10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01271273","volume":"16","author":"B Reed","year":"1996","unstructured":"Reed B, Shepherd F (1996) The Gallai-Younger conjecture for planar graphs. Combinatorica 16:555\u2013566","journal-title":"Combinatorica"},{"key":"9440_CR11","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/BF01271272","volume":"16","author":"B Reed","year":"1996","unstructured":"Reed B, Robertson N, Seymour P, Thomas R (1996) Packing directed circuits. Combinatorica 16:535\u2013554","journal-title":"Combinatorica"},{"key":"9440_CR12","first-page":"2.1","volume-title":"Proceedings of IEEE 16th Midwest symposium on circuit theory","author":"D Younger","year":"1973","unstructured":"Younger D (1973) Graphs with interlinked directed circuits. In: Proceedings of IEEE 16th Midwest symposium on circuit theory, vol\u00a02, pp\u00a02.1\u20132.7"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9440-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T22:24:32Z","timestamp":1686522272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9440-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,17]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9440"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9440-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,17]]}}}