{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:29Z","timestamp":1774370129194,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":3613,"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,10]]},"DOI":"10.1016\/s0166-218x(03)00389-5","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T22:32:50Z","timestamp":1063751570000},"page":"47-65","source":"Crossref","is-referenced-by-count":33,"title":["On the structure and stability number of P5- and co-chair-free graphs"],"prefix":"10.1016","volume":"132","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0166-218X(03)00389-5_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(03)00389-5_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(01)00268-0","article-title":"On the stable set problem in (P5,diamond)-free graphs, Manuscript, 1998","volume":"250","author":"Arbib","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB3","unstructured":"A. Brandst\u00e4dt, (P5,diamond)-Free Graphs Revisited: Structure, bounded clique width and linear time optimization, Technical Report CS-09-01, University of Rostock, 2001, Discrete Appl. Math., to appear."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB4","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, F.F. Dragan, H.-O. Le, R. Mosca, New graph classes of bounded clique width, Extended abstract in: Graph-Theoretic Concepts in Computer Science, 28 International Workshop, WG 2002, LNCS 2573, pp. 57\u2013cepted for Theory of Computing Systems.","DOI":"10.1007\/3-540-36379-3_6"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB5","unstructured":"A. Brandst\u00e4dt, C.T. Ho\u00e0ng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Technical Report CS-01-01, University of Rostock, 2001, Discrete Appl. Math., accepted."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB6","unstructured":"A. Brandst\u00e4dt, D. Kratsch, On the structure of (P5,gem)-free graphs, Discrete Appl. Math., 2001 accepted."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB7","article-title":"Graph Classes: A Survey","volume":"Vol. 3","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB8","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, H.-O. Le, J.-M. Vanherpe, Structure and stability number of (Chair,Co-P,Gem)-free graphs revisited, Information Processing Letter 86 (2003) 161\u2013167.","DOI":"10.1016\/S0020-0190(02)00487-8"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0166-218X(00)00239-0","article-title":"A note on \u03b1-redundant vertices in graphs","volume":"108","author":"Brandst\u00e4dt","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0166-218X(03)00180-X","article-title":"On variations of P4-sparse graphs","volume":"129","author":"Brandst\u00e4dt","year":"2003","journal-title":"Discrete Appl Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB11","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(03)00389-5_BIB12","first-page":"249","article-title":"Cographs","volume":"43","author":"Corneil","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB13","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(03)00389-5_BIB14","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(03)00389-5_BIB15","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(03)00389-5_BIB16","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(03)00389-5_BIB17","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, 68\u201384.","DOI":"10.1007\/BFb0017474"},{"issue":"2","key":"10.1016\/S0166-218X(03)00389-5_BIB18","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1006\/jagm.2001.1185","article-title":"Efficient and practical modular decomposition","volume":"41","author":"Dahlhaus","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB19","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(03)00389-5_BIB20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(89)90268-9","article-title":"On diameters and radii of bridged graphs","volume":"73","author":"Farber","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB21","first-page":"311","article-title":"Split graphs","volume":"19","author":"Foeldes","year":"1977","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB22","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)-free graphs","volume":"121","author":"Fouquet","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB23","first-page":"267","article-title":"On semi-P4-sparse graphs","volume":"165\u2013166","author":"Fouquet","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB24","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","article-title":"On graphs without P5 and P5","volume":"146","author":"Fouquet","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5,P5)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB26","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(03)00389-5_BIB27","unstructured":"C.T. Ho\u00e0ng, Perfect graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB28","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190130407","article-title":"Some classes of perfectly orderable graphs","volume":"13","author":"Ho\u00e0ng","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB29","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(03)00389-5_BIB30","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00460-9","article-title":"Stability in P5- and banner-free graphs","volume":"125","author":"Lozin","year":"2000","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/S0166-218X(03)00389-5_BIB31","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1142\/S0129054199000241","article-title":"On the clique width of graphs with few P4's","volume":"10","author":"Makowsky","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB32","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(03)00389-5_BIB33","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 (B)"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB34","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(03)00389-5_BIB35","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0020-0190(96)00197-4","article-title":"Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs","volume":"61","author":"Mosca","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB36","unstructured":"R. Mosca, Some results on maximum stable sets in certain P5-free graphs, Manuscript, 1997, Discrete Appl. Math., accepted."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB37","series-title":"Representations of Graphs, Book Manuscript","author":"Spinrad","year":"1998"},{"key":"10.1016\/S0166-218X(03)00389-5_BIB38","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00389-5_BIB39","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X03003895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T15:59:49Z","timestamp":1585151989000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X03003895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":39,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0166218X03003895"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00389-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}