{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:16:41Z","timestamp":1760573801161,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T00:00:00Z","timestamp":1758758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00373-025-02974-x","type":"journal-article","created":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T08:26:23Z","timestamp":1758788783000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved bounds on the chromatic number of ($$P_3\\cup P_2, W_4$$)-free graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5580-3829","authenticated-orcid":false,"given":"Di","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jinfeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,25]]},"reference":[{"key":"2974_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00373-017-1870-8","volume":"34","author":"AP Bharathi","year":"2018","unstructured":"Bharathi, A.P., Choudum, S.A.: Colouring of ($$p_3\\cup p_2$$)-free graphs. Graphs Comb. 34, 97\u2013107 (2018)","journal-title":"Graphs Comb."},{"key":"2974_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. MacMillan, London (1976)"},{"key":"2974_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.dam.2018.09.030","volume":"253","author":"C Brause","year":"2019","unstructured":"Brause, C., Randerath, B., Schiermeyer, I., Vumar, E.: On the chromatic number of $$2k_2$$-free graphs. Disc. Appl. Math. 253, 14\u201324 (2019)","journal-title":"Disc. Appl. Math."},{"key":"2974_CR4","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/jgt.22668","volume":"97","author":"K Cameron","year":"2021","unstructured":"Cameron, K., Huang, S., Merkel, O.: An optimal $$\\chi $$-bound for ($$p_6$$, diamond)-free graphs. J. of Graph Theory 97, 451\u2013465 (2021)","journal-title":"J. of Graph Theory"},{"key":"2974_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112795","volume":"345","author":"A Char","year":"2022","unstructured":"Char, A., Karthick, T.: Coloring of ($$p_5$$, 4-wheel)-free graphs. Disc. Math. 345, 112795 (2022)","journal-title":"Disc. Math."},{"key":"2974_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jgt.23009","volume":"105","author":"A Char","year":"2024","unstructured":"Char, A., Karthick, T.: Optimal chromatic bound for ($$p_3+ p_2$$, $$\\bar{p_3+ p_2}$$)-free graphs. J. of Graph Theory. 105, 149\u2013178 (2024)","journal-title":"J. of Graph Theory."},{"key":"2974_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2025.114554","volume":"10","author":"A Char","year":"2025","unstructured":"Char, A., Karthick, T.: An optimal chromatic bound for ($$p_2+ p_3$$, gem)-free graphs. Disc. Math. 10, 114554 (2025)","journal-title":"Disc. Math."},{"key":"2974_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2024.12.014","volume":"364","author":"A Char","year":"2025","unstructured":"Char, A., Karthick, T.: $$\\chi $$-boundedness and related problems on graphs without long induced paths: a survey. Disc. Appl. Math. 364, 99\u2013119 (2025)","journal-title":"Disc. Appl. Math."},{"key":"2974_CR9","doi-asserted-by":"publisher","first-page":"3398","DOI":"10.1016\/j.disc.2010.08.005","volume":"310","author":"SA Choudum","year":"2010","unstructured":"Choudum, S.A., Karthick, T.: Maximal cliques in $$(p_2\\cup p_3, c_4)$$-free graphs. Disc. Math. 310, 3398\u20133403 (2010)","journal-title":"Disc. Math."},{"key":"2974_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Can. J. Math. 11, 34\u201338 (1959)","journal-title":"Can. J. Math."},{"key":"2974_CR11","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. of Math. 164, 51\u2013229 (2006)","journal-title":"Ann. of Math."},{"key":"2974_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.jctb.2010.04.005","volume":"100","author":"M Chudnovsky","year":"2010","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs vi. Colouring. J. Comb. Theory. Ser. B. 100, 560\u2013572 (2010)","journal-title":"Colouring. J. Comb. Theory. Ser. B."},{"key":"2974_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","volume":"146","author":"J Fouquet","year":"1995","unstructured":"Fouquet, J., Giakoumakis, V., Maire, F., Thuillier, H.: On graphs without $$p_5$$ and $$\\overline{p_5}$$. Disc. Math. 146, 33\u201344 (1995)","journal-title":"Disc. Math."},{"key":"2974_CR14","unstructured":"Gei\u00dfer, M.: Colourings of $$P_5$$-free graphs (Ph. D. Thesis). Technische Universit\u00e4t Bergakademie Freiberg, (2022)"},{"key":"2974_CR15","unstructured":"Gy\u00e1rf\u00e1s, A.: On Ramsey covering-numbers, Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u0151s on his 60th birthday), Vol. II, Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, pp. 801-816 (1975)"},{"key":"2974_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.4064\/am-19-3-4-413-441","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastosowania Matematyki Applicationes Mathematicae. 19, 413\u2013441 (1987)","journal-title":"Zastosowania Matematyki Applicationes Mathematicae."},{"key":"2974_CR17","doi-asserted-by":"publisher","first-page":"3079","DOI":"10.1016\/j.disc.2018.07.018","volume":"341","author":"T Karthick","year":"2018","unstructured":"Karthick, T., Mishra, S.: Chromatic bounds for some classes of $$2k_2$$-free graphs. Disc. Math. 341, 3079\u20133088 (2018)","journal-title":"Disc. Math."},{"key":"2974_CR18","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00373-018-1905-9","volume":"34","author":"T Karthick","year":"2018","unstructured":"Karthick, T., Mishra, S.: On the chromatic number of ($$p_6$$, diamond)-free graphs. Graphs Comb. 34, 677\u2013692 (2018)","journal-title":"Graphs Comb."},{"key":"2974_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00373-025-02894-w","volume":"41","author":"R Li","year":"2025","unstructured":"Li, R., Li, J., Wu, D.: Optimal chromatic bound for ($$p_3\\cup p_2$$, house)-free graphs. Graphs Comb. 41, 28 (2025)","journal-title":"Graphs Comb."},{"key":"2974_CR20","doi-asserted-by":"publisher","unstructured":"Prashant, A., Francis, P., and Raj, S. F.: Linear $$\\chi $$-binding functions for some classes of $$(P_3\\cup P_2) $$-free graphs. AKCE Intern. J. Graph. Comb. https:\/\/doi.org\/10.1080\/09728600.2024.2308113.","DOI":"10.1080\/09728600.2024.2308113."},{"key":"2974_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2023.02.022","volume":"336","author":"A Prashant","year":"2023","unstructured":"Prashant, A., Raj, S.F., Gokulnath, M.: Bounds for the chromatic number of some $$pk_2$$-free graphs. Disc. Appl. Math. 336, 99\u2013108 (2023)","journal-title":"Disc. Appl. Math."},{"key":"2974_CR22","unstructured":"Prashant, A., Raj, S. F. and Gokulnath, M.: Linear $$\\chi $$-binding functions for ($$P_3\\cup P_2, gem$$)-free graphs, arXiv preprint arXiv:2305.11757, 2023"},{"key":"2974_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs-a survey. Graphs Comb. 20, 1\u201340 (2004)","journal-title":"Graphs Comb."},{"key":"2974_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-018-1999-0","volume":"35","author":"I Schiermeyer","year":"2019","unstructured":"Schiermeyer, I., Randerath, B.: Polynomial $$\\chi $$-binding functions and forbidden induced subgraphs: a survey. Graphs Comb. 35, 1\u201331 (2019)","journal-title":"Graphs Comb."},{"key":"2974_CR25","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/jgt.22601","volume":"95","author":"A Scott","year":"2020","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. J. of Graph Theory. 95, 473\u2013504 (2020)","journal-title":"J. of Graph Theory."},{"key":"2974_CR26","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s00493-023-00015-w","volume":"43","author":"A Scott","year":"2023","unstructured":"Scott, A., Seymour, P., Spirkl, S.: Polynomial bounds for chromatic number. IV. A near-polynomial bound for excluding the five-vertex path. Combinatorica. 43, 845\u2013852 (2023)","journal-title":"Combinatorica."},{"key":"2974_CR27","unstructured":"Sumner, D.P.: Subtrees of a graph and chromatic number. In: The Theory and Applications of Graphs, pp. 557\u2013576. John Wiley & Sons, New York (1981)"},{"key":"2974_CR28","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0095-8956(80)90093-3","volume":"29","author":"S Wagon","year":"1980","unstructured":"Wagon, S.: A bound on the chromatic number of graphs without certain induced subgraphs. J. Comb. Theory. Ser. B. 29, 345\u2013346 (1980)","journal-title":"J. Comb. Theory. Ser. B."},{"key":"2974_CR29","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/2071887","author":"X Wang","year":"2022","unstructured":"Wang, X., Zhang, D.: The $$\\chi $$-boundedness of $$(p_3\\cup p_2)$$-free graphs. J. of Math. (2022). https:\/\/doi.org\/10.1155\/2022\/2071887","journal-title":"J. of Math."},{"key":"2974_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s00373-023-02705-0","volume":"39","author":"D Wu","year":"2023","unstructured":"Wu, D., Xu, B.: Coloring of some crown-free graphs. Graphs Comb. 39, 106 (2023)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02974-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02974-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02974-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:23Z","timestamp":1760505083000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02974-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,25]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2974"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02974-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,9,25]]},"assertion":[{"value":"3 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 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 influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"109"}}