{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:56:10Z","timestamp":1648619770412},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0012-365x(92)90623-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"23-47","source":"Crossref","is-referenced-by-count":4,"title":["Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets"],"prefix":"10.1016","volume":"104","author":[{"given":"Michele","family":"Conforti","sequence":"first","affiliation":[]},{"given":"M.R.","family":"Rao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90623-N_BIB1","article-title":"Farbung von Graphen, deren samtliche bzw deren ungerade kreise starr sind (Zusammenfassung)","volume":"114","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe"},{"key":"10.1016\/0012-365X(92)90623-N_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0012-365X(92)90623-N_BIB3","article-title":"Topics on Perfect Graphs","volume":"Vol. 21","author":"Berge","year":"1984"},{"key":"10.1016\/0012-365X(92)90623-N_BIB4","series-title":"Topics on Perfect Graphs","article-title":"A composition for perfect graphs","volume":"Vol. 21","author":"Bixby","year":"1984"},{"key":"10.1016\/0012-365X(92)90623-N_BIB5","series-title":"Topics on Perfect Graphs","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"Vol. 21","author":"Burlet","year":"1984"},{"key":"10.1016\/0012-365X(92)90623-N_BIB6","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chvatal","year":"1975","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90623-N_BIB7","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":"Chvatal","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90623-N_BIB8","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","article-title":"Recognizing claw-free perfect graphs","volume":"44","author":"Chvatal","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90623-N_BIB9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02591849","article-title":"Structural properties and recognition of restricted and strongly unimodular matrices","volume":"38","author":"Conforti","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01589107","article-title":"Odd cycles and matrices with integrality properties","volume":"45","author":"Conforti","year":"1989","journal-title":"Math. Programming B"},{"key":"10.1016\/0012-365X(92)90623-N_BIB11","article-title":"Structural properties and decomposition of linear balanced matrices","author":"Conforti","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB12","article-title":"Properties of balanced and perfect matrices","author":"Conforti","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB13","article-title":"Testing balancedness and perfection of linear and star-decomposable matrices","author":"Conforti","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0012-365X(85)80001-7","article-title":"Compositions for perfect graphs","volume":"55","author":"Cornuejols","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90623-N_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","article-title":"On the perfect graph theorem","volume":"5","author":"Fulkerson","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB16","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lovasz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90623-N_BIB17","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01580235","article-title":"Perfect zero-one matrices","volume":"6","author":"Padberg","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(92)90623-N_BIB18","first-page":"279","article-title":"Characterizations of totally unimodular, balanced and perfect matrices","author":"Padberg","year":"1975","journal-title":"Combinatorial Programming, Methods and Applications"},{"key":"10.1016\/0012-365X(92)90623-N_BIB19","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90623-N_BIB20","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4153\/CJM-1973-009-3","article-title":"The strong perfect graph conjecture for planar graphs","volume":"25","author":"Tucker","year":"1973","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(92)90623-N_BIB21","series-title":"Theory and Application of Graphs","first-page":"580","article-title":"Circular arc graphs: New uses and a new algorithm","volume":"Vol. 642","author":"Tucker","year":"1978"},{"key":"10.1016\/0012-365X(92)90623-N_BIB22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","article-title":"An algorithm for finding clique-cutsets","volume":"12","author":"Whitesides","year":"1981","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0012-365X(92)90623-N_BIB23","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/moor.10.2.280","article-title":"On a class of totally unimodular matrices","volume":"10","author":"Yannakakis","year":"1985","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290623N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290623N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:27:28Z","timestamp":1555133248000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290623N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["0012365X9290623N"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90623-n","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}