{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T11:11:15Z","timestamp":1785409875101,"version":"3.56.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"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":[[2023,2]]},"DOI":"10.1007\/s00373-023-02613-3","type":"journal-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:59:08Z","timestamp":1674817148000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Comparison of the Grundy and b-Chromatic Number of $$K_{2,t}$$ -Free Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Zoya","family":"Masih","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manouchehr","family":"Zaker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"key":"2613_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"AJ Bondy","year":"2008","unstructured":"Bondy, A.J., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"2613_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-008-0829-1","volume":"25","author":"F Bonomo","year":"2009","unstructured":"Bonomo, F., Duran, G., Maffray, F., Marenco, J., Valencia-Pabon, M.: On the b-coloring of cographs and $$P_4$$-sparse graphs. Graphs Combin. 25, 1\u201315 (2009)","journal-title":"Graphs Combin."},{"key":"2613_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00453-014-9921-5","volume":"73","author":"F Bonomo","year":"2015","unstructured":"Bonomo, F., Schaudt, O., Stein, M., Valencia-Pabon, M.: b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Algorithmica 73, 289\u2013305 (2015)","journal-title":"Algorithmica"},{"key":"2613_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803888","volume-title":"Combinatorics: Topics, Techniques, Algorithms","author":"PJ Cameron","year":"1994","unstructured":"Cameron, P.J.: Combinatorics: Topics, Techniques, Algorithms. Cambridge University Press, Cambridge (1994)"},{"key":"2613_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2004.09.006","volume":"146","author":"S Corteel","year":"2005","unstructured":"Corteel, S., Valencia-Pabon, M., Vera, J.C.: On approximating the b-chromatic number. Disc. Appl. Math. 146, 106\u2013110 (2005)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR6","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1016\/j.disc.2016.03.011","volume":"339","author":"B Effantin","year":"2016","unstructured":"Effantin, B., Gastineau, N., Togni, O.: A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Discrete Math. 339, 2157\u20132167 (2016)","journal-title":"Discrete Math."},{"key":"2613_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(83)90003-1","volume":"35","author":"JR Griggs","year":"1983","unstructured":"Griggs, J.R.: An upper bound on the Ramsey numbers $$R(3, k)$$. J. Combin Theor. Ser. A. 35, 145\u2013153 (1983)","journal-title":"J. Combin Theor. Ser. A."},{"key":"2613_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first fit colorings of graphs. J. Graph Theory 12, 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"key":"2613_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s00453-011-9604-4","volume":"65","author":"F Havet","year":"2013","unstructured":"Havet, F., Sampaio, L.: On the Grundy and b-chromatic number of a graph. Algorithmica 65, 885\u2013899 (2013)","journal-title":"Algorithmica"},{"key":"2613_CR10","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.dam.2005.04.001","volume":"152","author":"CT Hoang","year":"2005","unstructured":"Hoang, C.T., Kouider, M.: On the $$b$$-dominating coloring of graphs. Disc. Appl. Math. 152, 176\u2013186 (2005)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR11","doi-asserted-by":"crossref","unstructured":"Illingworth, F.: Graphs with no induced $$K_{2, t}$$. Electron. J. Combin. 28,(2021)","DOI":"10.37236\/9223"},{"key":"2613_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"R Irving","year":"1999","unstructured":"Irving, R., Manlove, D.: The b-chromatic number of a graph. Disc. Appl. Math. 91, 127\u2013141 (1999)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.dam.2015.06.001","volume":"198","author":"M Kouider","year":"2016","unstructured":"Kouider, M.: On quasi-monotonous graphs. Disc. Appl. Math. 198, 155\u2013163 (2016)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR14","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.disc.2006.01.012","volume":"306","author":"M Kouider","year":"2006","unstructured":"Kouider, M., Zaker, M.: Bounds for the b-chromatic number of some families of graphs. Discrete Math. 306, 617\u2013623 (2006)","journal-title":"Discrete Math."},{"key":"2613_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-36379-3_27","volume-title":"On the b-Chromatic Number of Graphs","author":"J Kratochvil","year":"2002","unstructured":"Kratochvil, J., Tuza, Z., Voigt, M.: On the b-Chromatic Number of Graphs. Lecture Notes in Computer Science, vol. 2573, pp. 310\u2013320. Springer, Berlin (2002)"},{"key":"2613_CR16","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1017\/S0963548317000542","volume":"27","author":"PS Loh","year":"2018","unstructured":"Loh, P.S., Tait, M., Timmons, C., Zhou, R.M.: Induced Tur\u00e1n numbers. Comb. Probab. Comput. 27, 274\u2013288 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"2613_CR17","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00373-020-02268-4","volume":"37","author":"Z Masih","year":"2021","unstructured":"Masih, Z., Zaker, M.: On Grundy and b-chromatic number of some families of graphs: a comparative study. Graphs Combin. 37, 605\u2013620 (2021)","journal-title":"Graphs Combin."},{"key":"2613_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2021.09.015","volume":"306","author":"Z Masih","year":"2022","unstructured":"Masih, Z., Zaker, M.: Some comparative results concerning the Grundy and b-chromatic number of graphs. Disc. Appl. Math. 306, 1\u20136 (2022)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR19","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2010.10.002","volume":"159","author":"CIB Velasquez","year":"2011","unstructured":"Velasquez, C.I.B., Bonomo, F., Koch, I.: On the b-coloring of $$P_4$$-tidy graphs. Disc. Appl. Math. 159, 60\u201368 (2011)","journal-title":"Disc. Appl. Math."},{"key":"2613_CR20","unstructured":"Zaker, M.: A note concerning the Grundy and b-chromatic number of graphs. Accepted for Publication in Ars Combin. (2020) (also available in: arxiv:2003.14233)"},{"key":"2613_CR21","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1016\/j.disc.2005.06.044","volume":"306","author":"M Zaker","year":"2006","unstructured":"Zaker, M.: Results on the Grundy chromatic number of graphs. Discrete Math. 306, 3166\u20133173 (2006)","journal-title":"Discrete Math."}],"updated-by":[{"DOI":"10.1007\/s00373-026-03058-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T00:00:00Z","timestamp":1785369600000}}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02613-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02613-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02613-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T10:14:03Z","timestamp":1785406443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02613-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,27]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2613"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02613-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,27]]},"assertion":[{"value":"10 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2026","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original online version of this article was revised: the author\u2019s name Zoya Masih was incorrectly written as Zoia Masih.","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2026","order":9,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":10,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":11,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00373-026-03058-0","URL":"https:\/\/doi.org\/10.1007\/s00373-026-03058-0","order":12,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare they have no financial interests and have no relevant financial or non-financial interests to disclose.","order":1,"name":"Ethics","label":"Conflict of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"16"}}