{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:33:56Z","timestamp":1761294836071,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangdong Province Natural Science Foundation","award":["2021A1515012045"],"award-info":[{"award-number":["2021A1515012045"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12161073"],"award-info":[{"award-number":["12161073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s00373-025-02926-5","type":"journal-article","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T17:25:45Z","timestamp":1745601945000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the structure of some classes of $$(P_{2}\\cup P_{3})$$-free graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Zijian","family":"Deng","sequence":"first","affiliation":[]},{"given":"Caibing","family":"Chang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"2926_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00373-017-1870-8","volume":"34","author":"A Bharathi","year":"2018","unstructured":"Bharathi, A., Choudum, S.: Colouring of $$(P3\\cup P2)$$-free graphs. Graphs Combin. 34, 97\u2013107 (2018)","journal-title":"Graphs Combin."},{"issue":"2","key":"2926_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ipl.2014.09.024","volume":"115","author":"A Brandst\u00e4dt","year":"2015","unstructured":"Brandst\u00e4dt, A., Giakoumakis, V.: Addendum to: Maximum weight independent sets in hole- and co-chair free graphs. Inf. Process. Lett. 115(2), 256\u2013262 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"2926_CR3","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s00373-014-1461-x","volume":"31","author":"A Brandst\u00e4dt","year":"2015","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Maximum weight independent sets in odd-hole-free graphs without dart or without bull. Graphs Combin. 31(5), 1249\u20131262 (2015)","journal-title":"Graphs Combin."},{"issue":"2","key":"2926_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"F-RK Chung","year":"1990","unstructured":"Chung, F.-R.K., Gy\u00e1rf\u00e1s, A., Tuza, Z., Trotter, W.T.: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Math. 81(2), 129\u2013135 (1990)","journal-title":"Discrete Math."},{"key":"2926_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.jctb.2009.10.001","volume":"100","author":"M Chudnovsky","year":"2010","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: $$K_{4}$$-free graphs with no odd holes. J. Combin. Theory Ser. B 100, 313\u2013331 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2926_CR6","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1016\/j.jctb.2008.02.005","volume":"98","author":"M Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Safra, S.: The Erd\u0151s\u2013Hajnal conjecture for bull-free graphs. J. Combin. Theory Ser. B 98, 1301\u20131310 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2926_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"2926_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1002\/jgt.22367","volume":"90","author":"M Chudnovsky","year":"2019","unstructured":"Chudnovsky, M., Sivaraman, V.: Perfect divisibility and 2-divisibility. J. Graph Theory 90, 54\u201360 (2019)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2926_CR9","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/s10255-022-1110-8","volume":"38","author":"W Dong","year":"2022","unstructured":"Dong, W., Song, J.L., Xu, B.G.: 2-Divisibility of some odd hole free graphs. Acta Math. Appl. Sin. Engl. 38(3), 710\u2013718 (2022)","journal-title":"Acta Math. Appl. Sin. Engl."},{"key":"2926_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/jgt.22258","volume":"89","author":"CT Ho\u00e1ng","year":"2018","unstructured":"Ho\u00e1ng, C.T.: On the structure of ($${\\rm banner}, {\\rm odd hole})$$-free graphs. J. Graph Theory 89, 395\u2013412 (2018)","journal-title":"J. Graph Theory"},{"key":"2926_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(01)00054-1","volume":"242","author":"CT Ho\u00e1ng","year":"2002","unstructured":"Ho\u00e1ng, C.T., McDiarmid, C.: On the divisibility of graphs. Discrete Math. 242, 145\u2013156 (2002)","journal-title":"Discrete Math."},{"issue":"3","key":"2926_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.37236\/10348","volume":"29","author":"T Karthick","year":"2022","unstructured":"Karthick, T., Kaufmann, J., Sivaraman, V.: Coloring graph classes with no induced fork via perfect divisibility. Electron. J. Combin. 29(3), 19 (2022)","journal-title":"Electron. J. Combin."},{"doi-asserted-by":"publisher","unstructured":"Prashant, A., Francis, P., Raj, S.F.: $$\\chi $$-binding functions for some classes of $$P_{3}\\cup P_{2}$$-free graphs (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.06423","key":"2926_CR13","DOI":"10.48550\/arXiv.2203.06423"},{"doi-asserted-by":"publisher","unstructured":"Wang, X., Zhang, D.H.: The $$\\chi $$-boundedness of $$(P_{2}\\cup P_{3})$$-free graphs. Journal of Mathematics, (2022): https:\/\/doi.org\/10.1155\/2022\/2071887.","key":"2926_CR14","DOI":"10.1155\/2022\/2071887."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02926-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02926-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02926-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:15:39Z","timestamp":1748855739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02926-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,25]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2926"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02926-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,4,25]]},"assertion":[{"value":"24 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"63"}}