{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T01:33:57Z","timestamp":1778031237431,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T00:00:00Z","timestamp":1707523200000},"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":[[2024,4]]},"DOI":"10.1007\/s00373-024-02753-0","type":"journal-article","created":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T15:03:32Z","timestamp":1707577412000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Borodin\u2013Kostochka Conjecture Holds for Odd-Hole-Free Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Rong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiyang","family":"Lan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinheng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yidong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,10]]},"reference":[{"key":"2753_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0095-8956(77)90037-5","volume":"23","author":"O Borodin","year":"1997","unstructured":"Borodin, O., Kostochka, A.: On an upper bound of a graph\u2019s chromatic number. J. Combin. Theory Ser. B 23, 247\u2013250 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2753_CR2","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R Brooks","year":"1941","unstructured":"Brooks, R.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"2753_CR3","doi-asserted-by":"publisher","first-page":"113823","DOI":"10.1016\/j.disc.2023.113823","volume":"347","author":"R Chen","year":"2024","unstructured":"Chen, R., Lan, K., Lin, X.: Coloring hammer-free graphs with $$\\Delta -1$$ colors. Discrete Math. 347, 113823 (2024)","journal-title":"Discrete Math."},{"key":"2753_CR4","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/12088015X","volume":"27","author":"D Cranston","year":"2013","unstructured":"Cranston, D., Rabern, L.: Coloring claw-free graphs with $$\\Delta -1$$ colors. SIAM J. Disc. Math. 27, 534\u2013549 (2013)","journal-title":"SIAM J. Disc. Math."},{"key":"2753_CR5","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1002\/jgt.22845","volume":"100","author":"D Cranston","year":"2022","unstructured":"Cranston, D., Lafayette, H., Rabern, L.: Coloring $$\\{P_5$$, gem$$\\}$$-free graphs with $$\\Delta -1$$ colors. J. Gr. Theory 100, 633\u2013642 (2022)","journal-title":"J. Gr. Theory"},{"key":"2753_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01238034","volume":"54","author":"G Dirac","year":"1951","unstructured":"Dirac, G.: Note on the colouring of graphs. Math. Z. 54, 347\u2013353 (1951)","journal-title":"Math. Z."},{"key":"2753_CR7","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s12190-020-01419-3","volume":"65","author":"U Gupta","year":"2021","unstructured":"Gupta, U., Pradhan, D.: Borodin\u2013Kostochka\u2019s conjecture on $$\\{P_5, C_4\\}$$-free graphs. J. Appl. Math. Comput. 65, 877\u2013884 (2021)","journal-title":"J. Appl. Math. Comput."},{"key":"2753_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M Molloy","year":"2002","unstructured":"Molloy, M., Reed, B.: Graph Colouring and the Probabilistic Method, vol. 326. Springer, Berlin (2002)"},{"key":"2753_CR9","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1006\/jctb.1998.1891","volume":"76","author":"B Reed","year":"1999","unstructured":"Reed, B.: A strengthening of Brooks\u2019 theorem. J. Comb. Theory Ser. B 76, 136\u2013149 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2753_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.jctb.2015.10.002","volume":"121","author":"A Scott","year":"2016","unstructured":"Scott, A., Seymour, P.: Induced subgraphs of graphs with large chromatic number. I. Odd holes. J. Comb. Theory Ser. B 121, 68\u201384 (2016)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2753_CR11","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. Gr. Theory 95, 473\u2013504 (2020)","journal-title":"J. Gr. Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02753-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02753-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02753-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T18:03:06Z","timestamp":1714240986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02753-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,10]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2753"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02753-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,10]]},"assertion":[{"value":"31 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2024","order":4,"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"}}],"article-number":"26"}}