{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:01:38Z","timestamp":1726516898299},"reference-count":11,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"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":3490,"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":[[2004,2]]},"DOI":"10.1016\/s0012-365x(03)00295-4","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:32:50Z","timestamp":1063737170000},"page":"363-374","source":"Crossref","is-referenced-by-count":10,"title":["Clique-width of partner-limited graphs"],"prefix":"10.1016","volume":"276","author":[{"given":"Jean-Marie","family":"Vanherpe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00295-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(97)90120-7","article-title":"On the structure of graphs with few P4's","volume":"84","author":"Babel","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00295-4_BIB2","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. Syst. Sci."},{"key":"10.1016\/S0012-365X(03)00295-4_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/10692760_1","article-title":"Linear time solvable optimization problems on graphs of bounded clique width (extended abstract)","volume":"1517","author":"Courcelle","year":"1998","journal-title":"Lect. Notes Comput. Sci."},{"key":"10.1016\/S0012-365X(03)00295-4_BIB4","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\/S0012-365X(03)00295-4_BIB5","unstructured":"S. F\u00f6ldes, P.L. Hammer, Split graphs, in: F. Hoofman (Eds.), Eighth South-Eastern Conference On Combinatorics, Graph Theory and Computing, Vol. 19, Louisiana State University, Baton Rouge, Louisiana, 1977, pp. 311\u2013315."},{"key":"10.1016\/S0012-365X(03)00295-4_BIB6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1142\/S0129054199000368","article-title":"Bipartite graphs totally decomposable by canonical decomposition","volume":"10","author":"Fouquet","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"year":"1979","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0012-365X(03)00295-4_BIB7"},{"key":"10.1016\/S0012-365X(03)00295-4_BIB8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.232","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0012-365X(03)00295-4_BIB9"},{"key":"10.1016\/S0012-365X(03)00295-4_BIB10","unstructured":"C.T. Ho\u00e0ng, Perfect Graphs, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, 1985."},{"key":"10.1016\/S0012-365X(03)00295-4_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0129054199000083","article-title":"On graphs with limited number of P4-partners","volume":"10","author":"Roussel","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002954?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:21:40Z","timestamp":1704896500000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0012365X03002954"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00295-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}