{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:02:33Z","timestamp":1746331353825,"version":"3.40.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:00Z","timestamp":1740182400000},"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,4]]},"DOI":"10.1007\/s00373-025-02897-7","type":"journal-article","created":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T19:19:37Z","timestamp":1740251977000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Optimal $$\\chi $$-Binding Functions of ($$2K_1 \\cup K_2$$)-Free Graphs and ($$P_3 \\cup K_1$$)-Free Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-7311-7596","authenticated-orcid":false,"given":"C. U.","family":"Angeliya","sequence":"first","affiliation":[]},{"given":"Sheshayya","family":"Choudum","sequence":"additional","affiliation":[]},{"given":"Mayamma","family":"Joseph","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,22]]},"reference":[{"key":"2897_CR1","volume-title":"Graph Theory. Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics. Springer, New York (2008)"},{"key":"2897_CR2","doi-asserted-by":"crossref","unstructured":"Brooks, R.L.: On colouring the nodes of a network. In: Proceedings of the Cambridge Philosophical Society, pp. 194\u2013197 (1941)","DOI":"10.1017\/S030500410002168X"},{"key":"2897_CR3","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. Discrete Appl. Math. 364, 99\u2013119 (2025)","journal-title":"Discrete Appl. Math."},{"key":"2897_CR4","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."},{"issue":"6","key":"2897_CR5","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. Combin. Theory Ser. B 100(6), 560\u2013572 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"2897_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00373-023-02642-y","volume":"39","author":"W Dong","year":"2023","unstructured":"Dong, W., Xu, B., Xu, Y.: A tight linear bound to the chromatic number of ($$P_5$$, $$K_1 + (K_1 \\cup K_3$$))-free graphs. Graphs Combin. 39(3), 43 (2023)","journal-title":"Graphs Combin."},{"key":"2897_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. Can. J. Math. 11, 34\u201338 (1959)","journal-title":"Can. J. Math."},{"issue":"3\u20134","key":"2897_CR8","first-page":"413","volume":"19","author":"A Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastos. Mat. Appl. Math 19(3\u20134), 413\u2013441 (1987)","journal-title":"Zastos. Mat. Appl. Math"},{"key":"2897_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"JH Kim","year":"1995","unstructured":"Kim, J.H.: The ramsey number $$R(3,\\, t)$$ has order of magnitude $$t^2$$\/ log $$t$$. Random Struct. Algorithms 7, 173\u2013207 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"2897_CR10","doi-asserted-by":"crossref","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Proceedings of WG 2001, LNCS, pp. 254\u2013262. Springer (2001)","DOI":"10.1007\/3-540-45477-2_23"},{"issue":"1","key":"2897_CR11","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. Graph Combin. 20(1), 1\u201340 (2004)","journal-title":"Graph Combin."},{"key":"2897_CR12","unstructured":"Randerath, H.: The Vizing bound for the chromatic number based on forbidden pairs. Ph.D. thesis. RWTH Aachen, Shaker Verlag (1998)"},{"issue":"1","key":"2897_CR13","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 Combin. 35(1), 1\u201331 (2019)","journal-title":"Graphs Combin."},{"issue":"3","key":"2897_CR14","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(3), 473\u2013504 (2020)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2897_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","volume":"16","author":"D Seinsche","year":"1974","unstructured":"Seinsche, D.: On a property of the class of n-colorable graphs. J. Combin. Theory Ser. B 16(2), 191\u2013193 (1974)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2897_CR16","first-page":"557","volume-title":"The Theory and Applications of Graphs","author":"DP Sumner","year":"1981","unstructured":"Sumner, D.P.: Subtrees of a graph and chromatic number. In: Chartrand, G. (ed.) The Theory and Applications of Graphs, pp. 557\u2013576. Wiley, New York (1981)"},{"issue":"3","key":"2897_CR17","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. Combin. Theory Ser. B 29(3), 345\u2013346 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2897_CR18","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-hall, Englewood Cliffs (2000)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02897-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02897-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:17:02Z","timestamp":1746253022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02897-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,22]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2897"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02897-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,2,22]]},"assertion":[{"value":"17 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"39"}}