{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:45Z","timestamp":1725586845070},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_1","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["An Excluded Minor Characterization of Seymour Graphs"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Ageev","sequence":"first","affiliation":[]},{"given":"Yohann","family":"Benchetrit","sequence":"additional","affiliation":[]},{"given":"Andr\u00e1s","family":"Seb\u0151","sequence":"additional","affiliation":[]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/(SICI)1097-0118(199704)24:4<357::AID-JGT8>3.0.CO;2-N","volume":"24","author":"A.A. Ageev","year":"1997","unstructured":"Ageev, A.A., Kostochka, A.V., Szigeti, Z.: A characterization of Seymour graphs. J. Graph Theory\u00a024, 357\u2013364 (1997)","journal-title":"J. Graph Theory"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(92)90032-S","volume":"5","author":"A.M.H. Gerards","year":"1992","unstructured":"Gerards, A.M.H.: On shortest T-joins and packing T-cuts. J. Combin. Theory Ser. B\u00a05, 73\u201382 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01902352","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: 2-matchings and 2-covers of hypergraphs. Acta. Math. Sci. Hungar.\u00a026, 433\u2013444 (1975)","journal-title":"Acta. Math. Sci. Hungar."},{"key":"1_CR4","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, Akad\u00e9miai Kiad\u00f3, Budapest (1986)"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"M. Middendorf","year":"1993","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of the edge-disjoint paths problem. Combinatorica\u00a013(1), 97\u2013108 (1993)","journal-title":"Combinatorica"},{"key":"1_CR6","first-page":"273","volume":"1","author":"M.G. Guan","year":"1962","unstructured":"Guan, M.G.: Graphic programming using odd and even points. Chinese Mathematics\u00a01, 273\u2013277 (1962)","journal-title":"Chinese Mathematics"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0095-8956(90)90062-5","volume":"49","author":"A. Seb\u00f6","year":"1990","unstructured":"Seb\u00f6, A.: o, Undirected distances and the postman structure of graphs. J. Combin. Theory Ser. B\u00a049, 10\u201339 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P.D. Seymour","year":"1977","unstructured":"Seymour, P.D.: The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B\u00a023, 189\u2013222 (1977)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1112\/plms\/s3-42.1.178","volume":"42","author":"P.D. Seymour","year":"1981","unstructured":"Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. London Math. Soc. Ser.\u00a042(3), 178\u2013192 (1981)","journal-title":"Proc. London Math. Soc. Ser."},{"key":"1_CR10","unstructured":"Szigeti, Z.: On Seymour graphs, Technical Report No. 93803, Institute for Operations Research, Universit\u00e4t Bonn (1993)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:21:16Z","timestamp":1553811676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}