{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T08:03:11Z","timestamp":1773043391625,"version":"3.50.1"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":6376,"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":[[1996,2]]},"DOI":"10.1016\/0012-365x(94)00350-r","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"159-187","source":"Crossref","is-referenced-by-count":27,"title":["On edge perfectness and classes of bipartite graphs"],"prefix":"10.1016","volume":"149","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)00350-R_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","article-title":"Distance-hereditary graphs, Steiner trees, and connected domination","volume":"17","author":"d'Atri","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(94)00350-R_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00350-R_BIB3","series-title":"Special graph classes \u2014 a survey","author":"Brandst\u00e4dt","year":"1993"},{"key":"10.1016\/0012-365X(94)00350-R_BIB4","series-title":"Topics on perfect graphs","volume":"21","year":"1984"},{"key":"10.1016\/0012-365X(94)00350-R_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/0606012","article-title":"Covering, packing and generalized perfection","volume":"6","author":"Chang","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(94)00350-R_BIB6","first-page":"183","article-title":"Ordered matching and matching without alternating cycles in bipartite graphs","volume":"9","author":"Chaty","year":"1979","journal-title":"Utilitas Math."},{"key":"10.1016\/0012-365X(94)00350-R_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":"Chvat\u00e1l","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00350-R_BIB8","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1002\/jgt.3190110415","article-title":"Ki-covers. II. Ki-perfect graphs","volume":"11","author":"Conforti","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)00350-R_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1993.1049","article-title":"Stable set bounding in perfect and parity graphs","volume":"59","author":"Coneil","year":"1993","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00350-R_BIB10","series-title":"Proc. ORDAL '94","first-page":"176","article-title":"The computation of the jump number of convex graphs","volume":"Vol. 813","author":"Dahlhaus","year":"1994"},{"key":"10.1016\/0012-365X(94)00350-R_BIB11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB12","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(94)00350-R_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(94)00350-R_BIB14","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB15","article-title":"A characterization of chordal bipartite graphs","author":"Hammer","year":"1989"},{"key":"10.1016\/0012-365X(94)00350-R_BIB16","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory Ser B"},{"key":"10.1016\/0012-365X(94)00350-R_BIB17_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","article-title":"Optimizing weakly triangulated graphs","volume":"5","author":"Hayward","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00350-R_BIB17_2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01787477","article-title":"Optimizing weakly triangulated graphs","volume":"6","author":"Hayward","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(94)00350-R_BIB18","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(94)00350-R_BIB19","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"28","author":"Howorka","year":"1977","journal-title":"The Quart. J. Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(86)90031-2","article-title":"Neighborhood perfect graphs","volume":"61","author":"Lehel","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB21","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(94)00350-R_BIB22","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":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00383169","article-title":"Alternating cycle-free matchings","volume":"7","author":"M\u00fcller","year":"1990","journal-title":"Order"},{"key":"10.1016\/0012-365X(94)00350-R_BIB24","article-title":"Verallgemeinerte Perfektheit auf Graphen","author":"Nicolai","year":"1990"},{"key":"10.1016\/0012-365X(94)00350-R_BIB25","first-page":"147","article-title":"Beitr\u00e4ge zur Theorie der perfekten Graphen","volume":"8","author":"Olaru","year":"1972","journal-title":"Elektronische Inform. Kybernetik"},{"key":"10.1016\/0012-365X(94)00350-R_BIB26","first-page":"211","article-title":"Containment in Graph Theory: Covering graphs with cliques","volume":"39","author":"Orlin","year":"1977","journal-title":"Nederl. Akad. Wetensch. Indag. Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","article-title":"Bipartite Permutation Graphs","volume":"18","author":"Spinrad","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00340778","article-title":"A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders","volume":"3","author":"Steiner","year":"1987","journal-title":"Order"},{"key":"10.1016\/0012-365X(94)00350-R_BIB29","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01593791","article-title":"Line perfect graphs","volume":"12","author":"Trotter","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0012-365X(94)00350-R_BIB30","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0095-8956(83)90039-4","article-title":"Coloring graphs with stable cutsets","volume":"34","author":"Tucker","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)00350-R_BIB31","first-page":"140","article-title":"The validity of the perfect graph conjecture for K4-free graphs","volume":"21","author":"Tucker","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(94)00350-R_BIB32","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1137\/0210022","article-title":"Node-deletion problems on bipartite graphs","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400350R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9400350R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:22:55Z","timestamp":1556115775000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9400350R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0012365X9400350R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)00350-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}