{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T09:19:56Z","timestamp":1773220796193,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00373-022-02517-8","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T18:04:49Z","timestamp":1658513089000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Structure of Graphs Without Claw, $$4K_1$$ and co-R"],"prefix":"10.1007","volume":"38","author":[{"given":"Tala","family":"Abuadas","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"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"2517_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"LW Beineke","year":"1970","unstructured":"Beineke, L.W.: Characterizations of derived graphs. J. Combinatorial Theory 9, 129\u2013135 (1970)","journal-title":"J. Combinatorial Theory"},{"key":"2517_CR2","unstructured":"Berge, C.: F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10:114 (1961) 88"},{"key":"2517_CR3","doi-asserted-by":"crossref","unstructured":"Berge, C., Chv\u00e1tal, V. (eds.): Topics on perfect graphs. North-Holland, Amsterdam (1984)","DOI":"10.1016\/S0304-0208(08)72922-0"},{"key":"2517_CR4","doi-asserted-by":"crossref","unstructured":"Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes, Proceedings of ISAAC 2002, Lecture Notes in Computer Science 2518 (2002), pp. 44\u201354","DOI":"10.1007\/3-540-36136-7_5"},{"key":"2517_CR5","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.O., Lozin, V.V.: Clique-width for 4-vertex forbidden sugraphs. Theory Comput. Syst. 39, 561\u2013590 (2006)","journal-title":"Theory Comput. Syst."},{"key":"2517_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"2517_CR7","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0095-8956(88)90085-8","volume":"44","author":"V Chv\u00e1tal","year":"1988","unstructured":"Chv\u00e1tal, V., Sbihi, N.: Recognizing claw-free perfect graphs. J. Combinatorial Theory Ser. B 44, 154\u2013176 (1988)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"2517_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101, 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"key":"2517_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theory Comput. Syst. 33, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"2517_CR10","doi-asserted-by":"crossref","unstructured":"Dai, Y., Foley, A. M., Ho\u00e0ng, C. T.: On Coloring a Class of Claw-free Graphs: To the memory of Fr\u00e9d\u00e9ric Maffray, Electronic Notes in Theoretical Computer Science 346 (2019) 369\u2013377","DOI":"10.1016\/j.entcs.2019.08.033"},{"key":"2517_CR11","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2017.06.006","volume":"234","author":"DJ Fraser","year":"2018","unstructured":"Fraser, D.J., Hamel, A.M., Ho\u00e0ng, C.T., Maffray, F.: A coloring algorithm for $$4K_1$$-free line graphs. Disc. Appl. Math. 234, 76\u201385 (2018)","journal-title":"Disc. Appl. Math."},{"key":"2517_CR12","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs, in [3]"},{"key":"2517_CR13","first-page":"189","volume":"11","author":"W-L Hsu","year":"1981","unstructured":"Hsu, W.-L.: How to color claw-free perfect graphs. Ann. Discrete Math. 11, 189\u2013197 (1981)","journal-title":"Ann. Discrete Math."},{"key":"2517_CR14","first-page":"273","volume":"216","author":"VV Lozin","year":"2017","unstructured":"Lozin, V.V., Malyshev, D.S.: Vertex colouring of graphs with few obstructions Disc. Appl. Math. 216, 273\u2013280 (2017)","journal-title":"Appl. Math."},{"key":"2517_CR15","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","volume":"21","author":"KR Parthasarathy","year":"1976","unstructured":"Parthasarathy, K.R., Ravindra, G.: The strong perfect graph conjecture is true for $$K_{1,3}$$-free graphs. J. Combinatorial Theory Ser. B 21, 212\u2013223 (1976)","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"2517_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.tcs.2007.03.043","volume":"377","author":"M Rao","year":"2007","unstructured":"Rao, M.: MSOL partitioning problems on graphs of bounded tree width and clique-width. Theoret. Comput. Sci. 377, 260\u2013267 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02517-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02517-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02517-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T13:17:21Z","timestamp":1660223841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02517-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["2517"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02517-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"5 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All authors consent for the paper to be published in Graphs and Combinatoris.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"123"}}