{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:26Z","timestamp":1759063406144},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3643,"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,9]]},"DOI":"10.1016\/s0166-218x(02)00415-8","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"39-50","source":"Crossref","is-referenced-by-count":12,"title":["Stability number of bull- and chair-free graphs revisited"],"prefix":"10.1016","volume":"131","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ch\u0131\u0301nh T","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Bang","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0166-218X(02)00415-8_BIB1","first-page":"3","article-title":"A polynomial algorithm for finding maximum independent sets in fork-free graphs","volume":"6","author":"Alekseev","year":"1999","journal-title":"Discrete Anal. Oper. Res."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0166-218X(99)00062-1","article-title":"On the p-connectedness of graphs","volume":"95","author":"Babel","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB3","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, (P5, diamond)-Free graphs revisited: structure and linear time optimization, Discrete Applied Mathematics, in press.","DOI":"10.1016\/S0166-218X(03)00266-X"},{"key":"10.1016\/S0166-218X(02)00415-8_BIB4","unstructured":"A. Brandst\u00e4dt, V. Giakoumakis, J.-M. Vanherpe, On prime (P5,claw)-free, (P5,bull)-free, and (bull,claw)-free graphs and the maximum stable set problem, Manuscript, 2000."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB5","unstructured":"A. Brandst\u00e4dt, D. Kratsch, On (P5,gem)-free and (P5,gem,co-gem)-free graphs: structure and algorithmic applications, Manuscript, 2000."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB6","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, J. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics Applications, Vol. 3, SIAM, Philadelphia, PA, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"10.1016\/S0166-218X(02)00415-8_BIB7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB8","first-page":"249","article-title":"Cographs","volume":"43","author":"Corneil","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB9","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)00415-8_BIB10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","article-title":"Handle-rewriting hypergraph grammars","volume":"46","author":"Courcelle","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0166-218X(02)00415-8_BIB12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","article-title":"Upper bounds to the clique width of graphs","volume":"101","author":"Courcelle","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB13","doi-asserted-by":"crossref","unstructured":"A. Cournier, M. Habib, A new linear algorithm for modular decomposition, LIRMM, University Montpellier, 1995 (Preliminary version in: Trees in Algebra and Programming\u2014CAAP \u201994, Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, 1994, pp. 68\u201384).","DOI":"10.1007\/BFb0017474"},{"key":"10.1016\/S0166-218X(02)00415-8_BIB14","unstructured":"E. Dahlhaus, J. Gustedt, R.M. McConnell, Efficient and practical modular decomposition, Technical Report, TU Berlin FB Mathematik, 524\/1996 (1996), in: Conference Proceedings of the Eighth SODA, 1997, pp. 26\u201335."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01195324","article-title":"On the vertex packing problem","volume":"9","author":"De Simone","year":"1993","journal-title":"Graphs Combin."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0166-218X(93)90032-J","article-title":"Stability number of bull- and chair-free graphs","volume":"41","author":"De Simone","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(93)90539-6","article-title":"A decomposition for a class of (P5, P5\u00af)-free graphs","volume":"121","author":"Fouquet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","article-title":"On graphs without P5 and P5\u00af","volume":"146","author":"Fouquet","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5, P5\u00af)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB20","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1142\/S0129054100000260","article-title":"On the clique-width of perfect graph classes","volume":"11","author":"Golumbic","year":"2000","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB21","unstructured":"C.T. Ho\u00e0ng, A class of perfect graphs, M.Sc. Thesis, School of Computer Science, McGill University, Montreal, 1983."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB22","unstructured":"C.T. Ho\u00e0ng, Perfect graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A unique tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB24","unstructured":"R.M. McConnell, J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the Fifth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Arlington, Virginia, 1994, pp. 536\u2013543."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB25","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"28","author":"Minty","year":"1980","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00415-8_BIB26","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","article-title":"Algorithme de recherche d'un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile","volume":"29","author":"Sbihi","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00415-8_BIB28","unstructured":"J.P. Spinrad, Representations of graphs, Book Manuscript, Vanderbilt University, Nashville, TN, 1998."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:30:18Z","timestamp":1553671818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004158"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00415-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}