{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T06:11:30Z","timestamp":1775455890957,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:00:00Z","timestamp":1775433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:00:00Z","timestamp":1775433600000},"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":[[2026,6]]},"DOI":"10.1007\/s00373-026-03039-3","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T05:29:20Z","timestamp":1775453360000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Kennedy","family":"Cano","sequence":"first","affiliation":[]},{"given":"Emily","family":"Gutknecht","sequence":"additional","affiliation":[]},{"given":"Gautham","family":"Kappaganthula","sequence":"additional","affiliation":[]},{"given":"George","family":"Miller","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"additional","affiliation":[]},{"given":"Ezekiel","family":"Thornburgh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,6]]},"reference":[{"key":"3039_CR1","unstructured":"Allagan, J. A. D.: Choice Numbers, Ohba Numbers and Hall Numbers of some complete $$k$$-partite graphs, PhD Thesis, Auburn University (2009)"},{"key":"3039_CR2","first-page":"167","volume":"119","author":"JAD Allagan","year":"2015","unstructured":"Allagan, J.A.D., Johnson, P.D.: Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs. Ars Combin. 119, 167\u2013176 (2015)","journal-title":"Ars Combin."},{"key":"3039_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ejc.2017.05.007","volume":"65","author":"A Bernshteyn","year":"2017","unstructured":"Bernshteyn, A., Kostochka, A., Zhu, X.: DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65, 122\u2013129 (2017)","journal-title":"Eur. J. Comb."},{"key":"3039_CR4","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congr. Numer. 26, 125\u2013127 (1979)","journal-title":"Congr. Numer."},{"issue":"1","key":"3039_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F Galvin","year":"1995","unstructured":"Galvin, F.: The list chromatic index of a bipartite multigraph. J. Combinatorial Theory Series B 63(1), 153\u2013158 (1995)","journal-title":"J. Combinatorial Theory Series B"},{"issue":"1\u20133","key":"3039_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0012-365X(03)00033-5","volume":"268","author":"S Gravier","year":"2003","unstructured":"Gravier, S., Maffray, F., Mohar, B.: On a list-coloring problem. Discret. Math. 268(1\u20133), 303\u2013308 (2003)","journal-title":"Discret. Math."},{"issue":"5","key":"3039_CR7","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1002\/jgt.3190160510","volume":"16","author":"R H\u00e4ggkvist","year":"1992","unstructured":"H\u00e4ggkvist, R., Chetwynd, A.: Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16(5), 503\u2013516 (1992)","journal-title":"J. Graph Theory"},{"issue":"1","key":"3039_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1996.0001","volume":"73","author":"J Kahn","year":"1996","unstructured":"Kahn, J.: Asymptotically good list-colorings. J. Combin. Theory Ser. A 73(1), 1\u201359 (1996)","journal-title":"J. Combin. Theory Ser. A"},{"key":"3039_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.4310\/JOC.2021.v12.n3.a4","volume":"12","author":"H Kaul","year":"2021","unstructured":"Kaul, H., Mudrock, J.: Criticality, the list color function, and list coloring the Cartesian product of graphs. Journal of Combinatorics 12, 479\u2013514 (2021)","journal-title":"Journal of Combinatorics"},{"key":"3039_CR10","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1007\/s00373-019-02084-5","volume":"35","author":"H Kaul","year":"2019","unstructured":"Kaul, H., Mudrock, J.: List coloring a Cartesian product with a complete bipartite factor. Graphs and Combinatorics 35, 1571\u20131583 (2019)","journal-title":"Graphs and Combinatorics"},{"key":"3039_CR11","unstructured":"Noel, J. A.: List colourings of complete multipartite graphs with 2 big parts, Open Problem Garden, April (2014). Retrieved on 4 February 2024 from http:\/\/www.openproblemgarden.org\/op\/list_colourings_of_complete_multipartite_graphs_with_2_big_parts"},{"issue":"2","key":"3039_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1002\/jgt.21819","volume":"79","author":"JA Noel","year":"2015","unstructured":"Noel, J.A., Reed, B.A., Wu, H.: A proof of a conjecture of Ohba. J. Graph Theory 79(2), 86\u2013102 (2015)","journal-title":"J. Graph Theory"},{"issue":"2","key":"3039_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/jgt.10033","volume":"40","author":"K Ohba","year":"2002","unstructured":"Ohba, K.: On chromatic-choosable graphs. J. Graph Theory 40(2), 130\u2013135 (2002)","journal-title":"J. Graph Theory"},{"key":"3039_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","volume":"19","author":"A Prowse","year":"2003","unstructured":"Prowse, A., Woodall, D.R.: Choosability of powers of circuits. Graphs Combin. 19, 137\u2013144 (2003)","journal-title":"Graphs Combin."},{"key":"3039_CR15","doi-asserted-by":"publisher","first-page":"4931","DOI":"10.1016\/j.disc.2008.05.021","volume":"309","author":"M Stiebitz","year":"2009","unstructured":"Stiebitz, M., Tuza, Z., Voigt, M.: On list critical graphs. Discret. Math. 309, 4931\u20134941 (2009)","journal-title":"Discret. Math."},{"key":"3039_CR16","unstructured":"Tuza, Zs., Voigt, M.: On a conjecture of Erd\u0151s, Rubin, and Taylor, Tatra Mt. Math Publ. 9 69-82 (1996)"},{"key":"3039_CR17","unstructured":"Vizing, V. G.: Coloring the vertices of a graph in prescribed colors, Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem 101 3-10 (1976)"},{"key":"3039_CR18","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03039-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03039-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03039-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T05:29:21Z","timestamp":1775453361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03039-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3039"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03039-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,6]]},"assertion":[{"value":"23 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"44"}}