{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T02:33:35Z","timestamp":1776911615102,"version":"3.51.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"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,2]]},"DOI":"10.1007\/s00373-025-02894-w","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T12:46:15Z","timestamp":1737549975000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Chromatic Bound for ($$P_3\\cup P_2$$, House)-Free Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Rui","family":"Li","sequence":"first","affiliation":[]},{"given":"Jinfeng","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5580-3829","authenticated-orcid":false,"given":"Di","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"2894_CR1","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.disc.2011.02.021","volume":"311","author":"NR Aravind","year":"2011","unstructured":"Aravind, N.R., Karthick, T., Subramanian, C.R.: Bounding $$\\chi $$ in terms of $$\\omega $$ and $$\\Delta $$ for some classes of graphs. Disc. Math. 311, 911\u2013920 (2011)","journal-title":"Disc. Math."},{"key":"2894_CR2","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":"2894_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"2894_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. Graph Theory 97, 451\u2013465 (2021)","journal-title":"J. Graph Theory"},{"key":"2894_CR5","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\\cup P_2$$, $$\\bar{P_3\\cup P_2}$$)-free graphs. J. Graph Theory 105, 149\u2013178 (2024)","journal-title":"J. Graph Theory"},{"key":"2894_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. Annal. Math. 164, 51\u2013229 (2006)","journal-title":"Annal. Math."},{"key":"2894_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P.: Graph theory and probability. Canadian J. Math. 11, 34\u201338 (1959)","journal-title":"Canadian J. Math."},{"key":"2894_CR8","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 $$\\bar{P_5}$$. Disc. Math. 146, 33\u201344 (1995)","journal-title":"Disc. Math."},{"key":"2894_CR9","unstructured":"Gei\u00dfer, M.: Colourings of $$P_5$$-free graphs (Ph. D. Thesis), Technische Universit\u00e4t Bergakademie Freiberg (2022)"},{"key":"2894_CR10","unstructured":"Gy\u00e1rf\u00e1s, A.: On Ramsey covering-numbers, Infinite and Finite Sets (Colloq., Keszthely, 1973; dedicated to P. Erd\u00f6s on his 60th birthday), Vol. II, Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, pp. 801\u2013816 (1975)"},{"key":"2894_CR11","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":"2894_CR12","unstructured":"Li, R., Li, J., Wu, D.: A tight linear chromatic bound for ($$ P_3\\cup P_2, W_4 $$)-free graphs. arXiv preprint arXiv:2308.08768, (2023)"},{"key":"2894_CR13","doi-asserted-by":"publisher","unstructured":"Prashant, A., Francis, P., 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":"2894_CR14","unstructured":"Prashant, A., Raj, S. F., Gokulnath, M.: Linear $$\\chi $$-binding functions for ($$P_3\\cup P_2$$, gem)-free graphs. arXiv preprint arXiv:2305.11757 (2023)"},{"key":"2894_CR15","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":"2894_CR16","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":"2894_CR17","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s00493-023-00015-w"},{"key":"2894_CR18","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. Graph Theory. 95, 473\u2013504 (2020)","journal-title":"J. Graph Theory."},{"key":"2894_CR19","unstructured":"Sumner, D.P.: Subtrees of a graph and chromatic number. In: The Theory and Applications of Graphs, John Wiley & Sons, New York, pp. 557\u2013576 (1981)"},{"key":"2894_CR20","unstructured":"Wang, X., Zhang, D.: The $$\\chi $$-Boundedness of $$(P_3\\cup P_2)$$-Free Graphs. J. Math. (2022)"},{"key":"2894_CR21","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-02894-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02894-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02894-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:47Z","timestamp":1748319767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02894-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2894"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02894-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"1 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 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":"28"}}