{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T01:34:01Z","timestamp":1778031241164,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T00:00:00Z","timestamp":1596499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T00:00:00Z","timestamp":1596499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s12190-020-01419-3","type":"journal-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T12:02:36Z","timestamp":1596542556000},"page":"877-884","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Borodin\u2013Kostochka\u2019s conjecture on $$(P_5,C_4)$$-free graphs"],"prefix":"10.1007","volume":"65","author":[{"given":"Uttam K.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"D.","family":"Pradhan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,4]]},"reference":[{"key":"1419_CR1","doi-asserted-by":"crossref","unstructured":"Brooks, R.L.: On colouring the nodes of a network. In: Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, Cambridge, vol. 37, issue 2, pp. 194\u2013197 (1941)","DOI":"10.1017\/S030500410002168X"},{"issue":"2\u20133","key":"1419_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0095-8956(77)90037-5","volume":"23","author":"OV Borodin","year":"1977","unstructured":"Borodin, O.V., Kostochka, A.V.: On an upper bound of a graph\u2019s chromatic number, depending on the graph\u2019s degree and density. J. Comb. Theory Ser. B 23(2\u20133), 247\u2013250 (1977)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1419_CR3","unstructured":"Catlin, P.A.:. Embedding subgraphs and coloring graphs under extremal degree conditions. ProQuest LLC, Ann Arbor, MI, Thesis (Ph.D.). The Ohio State University (1976)"},{"key":"1419_CR4","unstructured":"Cranston, D.W., Lafayette, H., Rabern, L.: Coloring $$(P_5,gem)$$-free graphs with $$\\Delta -1$$ colors. arXiv:2006.02015 (2020)"},{"issue":"4","key":"1419_CR5","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1137\/130929515","volume":"29","author":"DW Cranston","year":"2015","unstructured":"Cranston, D.W., Rabern, L.: Graphs with $$\\chi =\\Delta $$ have big cliques. SIAM J. Discrete Math. 29(4), 1792\u20131814 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"1419_CR6","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/12088015X","volume":"27","author":"DW Cranston","year":"2013","unstructured":"Cranston, D.W., Rabern, L.: Coloring claw-free graphs with $$\\Delta -1$$ colors. SIAM J. Discrete Math. 27(1), 534\u2013549 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1419_CR7","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01238034","volume":"54","author":"GA Dirac","year":"1951","unstructured":"Dirac, G.A.: Note on the colouring of graphs. Math. Z. 54, 347\u2013353 (1951)","journal-title":"Math. Z."},{"issue":"1","key":"1419_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0012-365X(82)90052-8","volume":"42","author":"M Dhurandhar","year":"1982","unstructured":"Dhurandhar, M.: Improvement on Brooks\u2019 chromatic bound for a class of graphs. Discrete Math. 42(1), 51\u201356 (1982)","journal-title":"Discrete Math."},{"key":"1419_CR9","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"issue":"3","key":"1419_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(86)90142-1","volume":"58","author":"HA Kierstead","year":"1986","unstructured":"Kierstead, H.A., Schmerl, J.H.: The chromatic number of graphs which induce neither $$K_{1,3}$$ nor $$K_5-e$$. Discrete Math. 58(3), 253\u2013262 (1986)","journal-title":"Discrete Math."},{"issue":"9","key":"1419_CR11","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1016\/j.disc.2009.05.025","volume":"310","author":"A Kohl","year":"2010","unstructured":"Kohl, A., Schiemeyer, I.: Some results on Reed\u2019s Conjecture about $$\\omega $$, $$\\Delta $$, and $$\\chi $$ with respect to $$\\alpha $$. Discrete Math. 310(9), 1429\u20131438 (2010)","journal-title":"Discrete Math."},{"key":"1419_CR12","first-page":"45","volume":"35","author":"AV Kostochka","year":"1980","unstructured":"Kostochka, A.V.: Degree, density, and chromatic number. Metody Diskret. Anal. 35, 45\u201370 (1980)","journal-title":"Metody Diskret. Anal."},{"issue":"6","key":"1419_CR13","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.disc.2011.12.014","volume":"312","author":"AV Kostochka","year":"2012","unstructured":"Kostochka, A.V., Rabern, L., Stiebitz, M.: Graphs with chromatic number close to maximum degree. Discrete Math. 312(6), 1273\u20131281 (2012)","journal-title":"Discrete Math."},{"issue":"2","key":"1419_CR14","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(2), 136\u2013149 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1419_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-018-1999-0","volume":"35","author":"I Schiermeyer","year":"2018","unstructured":"Schiermeyer, I., Randerath, B.: Polynomial $$\\chi $$-binding functions and forbidden induced subgraphs\u2014a survey. Graphs Combin. 35, 1\u201331 (2018)","journal-title":"Graphs Combin."},{"key":"1419_CR16","unstructured":"Scott, A., Seymour, P.: A survey of $$\\chi $$-boundedness. arXiv:1812.07500 (2018)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01419-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01419-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01419-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,3]],"date-time":"2021-08-03T23:55:57Z","timestamp":1628034957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01419-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,4]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1419"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01419-3","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,4]]},"assertion":[{"value":"9 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}