{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T14:16:55Z","timestamp":1777299415724,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:00:00Z","timestamp":1772064000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.dam.2026.02.030","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T17:18:51Z","timestamp":1773163131000},"page":"65-95","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On graphs without four-vertex induced subgraphs"],"prefix":"10.1016","volume":"388","author":[{"given":"Kathie","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6782-1194","authenticated-orcid":false,"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taite","family":"LaGrange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.030_b1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00373-022-02517-8","article-title":"On the structure of graphs without claw, 4K1, and co-r","volume":"38","author":"Abuadas","year":"2022","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2026.02.030_b2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","article-title":"Characterizations of derived graphs","volume":"9","author":"Beineke","year":"1970","journal-title":"J. Comb. Theory"},{"issue":"114","key":"10.1016\/j.dam.2026.02.030_b3","first-page":"88","article-title":"F\u00e4rbung von graphen, deren s\u00e4mtliche bzw","volume":"10","author":"Berge","year":"1961","journal-title":"Deren Ungerade Kreise Starr Sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math. -Natur. Reihe"},{"key":"10.1016\/j.dam.2026.02.030_b4","series-title":"Topics on Perfect Graphs","year":"1984"},{"key":"10.1016\/j.dam.2026.02.030_b5","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","article-title":"Clique-width for 4-vertex forbidden sugraphs","volume":"39","author":"Brandst\u00e4dt","year":"2006","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.dam.2026.02.030_b6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Ann. Math."},{"key":"10.1016\/j.dam.2026.02.030_b7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","article-title":"Recognizing claw-free perfect graphs","volume":"44","author":"Chv\u00e1tal","year":"1988","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.030_b8","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. Syst."},{"key":"10.1016\/j.dam.2026.02.030_b9","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\/j.dam.2026.02.030_b10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.entcs.2019.08.033","article-title":"On coloring a class of claw-free graphs: To the memory of Fr\u00e9d\u00e9ric Maffray","volume":"346","author":"Dai","year":"2019","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.dam.2026.02.030_b11","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2022.02.009","article-title":"Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs","volume":"914","author":"Dai","year":"2022","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.02.030_b12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.dam.2017.06.006","article-title":"A coloring algorithm for 4K1-free line graphs","volume":"234","author":"Fraser","year":"2018","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/j.dam.2026.02.030_b13","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Polynomial algorithms for perfect graphs. inBerChv198."},{"key":"10.1016\/j.dam.2026.02.030_b14","series-title":"Handbook of Graph Theory. Combinatorial Optimization and Algorithms","article-title":"Perfect graphs","author":"Ho\u00e0ng","year":"2015"},{"key":"10.1016\/j.dam.2026.02.030_b15","first-page":"189","article-title":"How to color claw-free perfect graphs","volume":"11","author":"Hsu","year":"1981","journal-title":"Ann. Discret. Math."},{"key":"10.1016\/j.dam.2026.02.030_b16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.dam.2015.02.015","article-title":"Vertex colouring of graphs with few obstructions","volume":"216","author":"Lozin","year":"2017","journal-title":"Disc Appl. Math."},{"key":"10.1016\/j.dam.2026.02.030_b17","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","article-title":"The strong perfect graph conjecture is true for K1,3-free graphs","volume":"21","author":"Parthasarathy","year":"1976","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.030_b18","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","article-title":"MSOL partitioning problems on graphs of bounded tree width and clique-width","volume":"377","author":"Rao","year":"2007","journal-title":"Theoret. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26001095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:27:52Z","timestamp":1777296472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26001095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":18,"alternative-id":["S0166218X26001095"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.030","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On graphs without four-vertex induced subgraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.030","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}