{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:17Z","timestamp":1759063817293},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3674,"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,8]]},"DOI":"10.1016\/s0166-218x(03)00180-x","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T20:46:14Z","timestamp":1058906774000},"page":"521-532","source":"Crossref","is-referenced-by-count":16,"title":["On variations of P4-sparse graphs"],"prefix":"10.1016","volume":"129","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":[{"key":"10.1016\/S0166-218X(03)00180-X_BIB1","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(03)00180-X_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(96)00114-X","article-title":"A nice class for the vertex packing problem","volume":"76","author":"Bertolazzi","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB3","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, C.T. Ho\u00e0ng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Discrete Applied Math, to appear.","DOI":"10.1016\/S0166-218X(02)00415-8"},{"key":"10.1016\/S0166-218X(03)00180-X_BIB4","article-title":"Graph Classes: A Survey","volume":"Vol. 3","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/S0166-218X(03)00180-X_BIB5","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, R. Mosca, On the structure and stability number of P5- and co-chair-free graphs, Discrete Appl. Math., accepted for publication.","DOI":"10.1016\/S0166-218X(03)00389-5"},{"key":"10.1016\/S0166-218X(03)00180-X_BIB6","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)00180-X_BIB7","first-page":"249","article-title":"Cographs","volume":"43","author":"Corneil","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB8","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)00180-X_BIB9","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. Systems Sci."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB10","doi-asserted-by":"crossref","unstructured":"B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, extended abstract, in: Conference Proceedings of WG\u201998, Lecture Notes in Computer Science, Vol. 1517, Springer, Berlin, 1998, pp. 1\u201316; Theory Comput. Systems 33 (2000) 125\u2013150.","DOI":"10.1007\/10692760_1"},{"key":"10.1016\/S0166-218X(03)00180-X_BIB11","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)00180-X_BIB12","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."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB13","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)00180-X_BIB14","first-page":"311","article-title":"Split graphs","volume":"19","author":"Foeldes","year":"1977","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB15","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)00180-X_BIB16","first-page":"17","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discrete Appl. Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","article-title":"On extended P4-reducible and extended P4-sparse graphs","volume":"180","author":"Giakoumakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","article-title":"Difference graphs","volume":"28","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB19","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)00180-X_BIB20","unstructured":"C.T. Ho\u00e0ng, Perfect graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB21","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)00180-X_BIB22","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"Recognizing P4-sparse graphs in linear time","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(03)00180-X_BIB24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","article-title":"Linear time optimization algorithms for P4-sparse graphs","volume":"61","author":"Jamison","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/S0166-218X(03)00180-X_BIB25","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)00180-X_BIB26","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)00180-X_BIB27","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:S0166218X0300180X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0300180X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T20:03:31Z","timestamp":1585080211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0300180X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0166218X0300180X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(03)00180-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}