{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:23:21Z","timestamp":1775622201218,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"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":3364,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0166-218x(03)00364-0","type":"journal-article","created":{"date-parts":[[2003,8,12]],"date-time":"2003-08-12T15:29:34Z","timestamp":1060702174000},"page":"41-91","source":"Crossref","is-referenced-by-count":16,"title":["Decomposition of odd-hole-free graphs by double star cutsets and 2-joins"],"prefix":"10.1016","volume":"141","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(03)00364-0_BIB1","unstructured":"M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, preprint, 2002."},{"key":"10.1016\/S0166-218X(03)00364-0_BIB2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","article-title":"Star-cutsets and perfect graphs","volume":"39","author":"Chv\u00e1tal","year":"1985","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB3","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0095-8956(02)00021-7","article-title":"Graphs without odd holes, parachutes or proper wheels","volume":"87","author":"Conforti","year":"2003","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s004930200001","article-title":"Perfect graphs, partitionable graphs and cutsets","volume":"22","author":"Conforti","year":"2002","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB5","series-title":"Proceedings of the Fourth International Integer Programming and Combinatorial Optimization Conference, Copenhagen, Denmark","first-page":"321","article-title":"A Mickey mouse decomposition theorem","volume":"Vol. 920","author":"Conforti","year":"1995"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1002\/jgt.10006","article-title":"Even-hole-free graphs, Part I: decomposition theorem","volume":"39","author":"Conforti","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1002\/jgt.10045","article-title":"Even-hole-free graphs, Part II: recognition algorithm","volume":"40","author":"Conforti","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00364-0_BIB8","unstructured":"M. Conforti, G. Cornu\u00e9jols, K. Vu\u0161kovi\u0107, Square-free perfect graphs, J. Combin. Theory B, to appear, 2001."},{"key":"10.1016\/S0166-218X(03)00364-0_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","article-title":"Composition for perfect graphs","volume":"55","author":"Cornu\u00e9jols","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00364-0_BIB10","unstructured":"J.F. Geelen, Matchings, Matroids and unimodular matrices, Ph.D. Thesis, University of Waterloo, 1995."},{"key":"10.1016\/S0166-218X(03)00364-0_BIB11","unstructured":"A. Kapoor, On the structure of balanced matrices and perfect graphs, Ph.D. Thesis, Carnegie Mellon University, 1994."},{"key":"10.1016\/S0166-218X(03)00364-0_BIB12","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/0095-8956(82)90028-4","article-title":"Alpha-balanced graphs and matrices and GF(3)-representability of matroids","volume":"32","author":"Truemper","year":"1982","journal-title":"J. Combin. Theory B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003640?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003640?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T20:22:12Z","timestamp":1552594932000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S0166218X03003640"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00364-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}