{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T19:10:45Z","timestamp":1682449845029},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00390-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"581-599","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite-perfect graphs"],"prefix":"10.1016","volume":"127","author":[{"given":"Van","family":"Bang Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00390-6_BIB1","unstructured":"L. Babel, On the P4-structure of graphs, Habilitationsschrift, TU M\u00fcnchen, Germany, 1997."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(99)00104-3","article-title":"Recognizing the P4-structure of bipartite graphs","volume":"93","author":"Babel","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.46298\/dmtcs.294","article-title":"Recognizing the P4-structure of claw-free graphs and of a larger class of graphs","volume":"5","author":"Babel","year":"2002","journal-title":"Discrete Math. and Theoretical Computer Science"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB4","doi-asserted-by":"crossref","unstructured":"C. Berge, V. Chv\u00e1tal (Eds.), Topics on perfect graphs, Annals of Discrete Math. 21, North-Holland, Amsterdam, 1984.","DOI":"10.1016\/S0304-0208(08)72921-9"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(99)00071-2","article-title":"Tree- and forest-perfect graphs","volume":"95","author":"Brandst\u00e4dt","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/S0166-218X(99)00145-6","article-title":"Recognizing the P4-structure of block graphs","volume":"99","author":"Brandst\u00e4dt","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB7","unstructured":"A. Brandst\u00e4dt, V.B. Le, Split-perfect graphs: characterizations and algorithmic use, accepted by SIAM Journal of Discrete Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB8","unstructured":"A. Brandst\u00e4dt, V.B. Le, S. Olariu, Linear-time recognition of the P4-structure of trees, Rutcor Research Report RRR 19-96, Rutgers University, 1996."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s003730070002","article-title":"Efficiently recognizing the P4-structure of trees and of bipartite graphs without short cycles","volume":"16","author":"Brandst\u00e4dt","year":"2000","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB10","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, J.P. Spinrad, Graph Classes: a Survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB11","first-page":"279","article-title":"A semi-strong perfect graph conjecture","volume":"21","author":"Chv\u00e1tal","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB12","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB13","doi-asserted-by":"crossref","unstructured":"A. Cournier, M. Habib, A new linear algorithm for modular decomposition, LIRMM, University Montpellier, 1995, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 68\u201384.","DOI":"10.1007\/BFb0017474"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02986682","article-title":"Recognizing the P4-structure of a tree","volume":"10","author":"Ding","year":"1994","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB15","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB16","unstructured":"R. Hayward, S. Hougardy, B. Reed, Recognizing P4-structure, manuscript, 1996."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB17","unstructured":"S. Hougardy, On the P4-structure of perfect graphs, Dissertation Thesis, Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, 1995."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","article-title":"p-components and the homogeneous decomposition of graphs","volume":"8","author":"Jamison","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","article-title":"Modular decomposition and transitive orientation","volume":"201","author":"McConnell","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00390-6_BIB20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0095-8956(87)90022-0","article-title":"A semi-strong perfect graph theorem","volume":"43","author":"Reed","year":"1987","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0166-218X(02)00390-6_BIB21","unstructured":"S. Sorg, Die P4-Struktur von Kantengraphen bipartiter Graphen, Diploma Thesis, Mathematisches Institut der Universit\u00e4t zu K\u00f6ln, 1997."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003906?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02003906?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T18:45:11Z","timestamp":1682448311000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02003906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02003906"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00390-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}