{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:57Z","timestamp":1740107097904,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T00:00:00Z","timestamp":1604793600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T00:00:00Z","timestamp":1604793600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02255-9","type":"journal-article","created":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T09:07:07Z","timestamp":1604826427000},"page":"381-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proportional Choosability of Complete Bipartite Graphs"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"first","affiliation":[]},{"given":"Jade","family":"Hewitt","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Collin","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,8]]},"reference":[{"key":"2255_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548300000122","volume":"1","author":"N Alon","year":"1992","unstructured":"Alon, N.: Choice numbers of graphs; a probabilistic approach. Comb. Probab. Comput. 1, 107\u2013114 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"2255_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1002\/1098-2418(200007)16:4<364::AID-RSA5>3.0.CO;2-0","volume":"16","author":"N Alon","year":"2000","unstructured":"Alon, N.: Degrees and choice numbers. Random Struct. Algor. 16, 364\u2013368 (2000)","journal-title":"Random Struct. Algor."},{"key":"2255_CR3","unstructured":"Erd\u0151s, P.: Problem 9. In: Fiedler, M. (ed) Theory of graphs and its applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159. (1964)"},{"key":"2255_CR4","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congressus Numerantium 26, 125\u2013127 (1979)","journal-title":"Congressus Numerantium"},{"issue":"2","key":"2255_CR5","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1002\/jgt.21896","volume":"82","author":"Z F\u0171redi","year":"2016","unstructured":"F\u0171redi, Z., Kantor, I.: List colorings with distinct list sizes, the case of complete bipartite graphs. J. Graph Theory 82(2), 218\u2013227 (2016)","journal-title":"J. Graph Theory"},{"key":"2255_CR6","first-page":"601","volume-title":"Combinatorial theory and its applications","author":"A Hajn\u00e1l","year":"1970","unstructured":"Hajn\u00e1l, A., Szemer\u00e9di, E.: Proof of a conjecture of Erd\u0151s. In: R\u00e9nyi, A., S\u00f3s, V.T. (eds.) Combinatorial theory and its applications, vol. II, pp. 601\u2013623. North-Holland, Amsterdam (1970)"},{"key":"2255_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representation of subsets. J. Lond. Mat. Sc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Mat. Sc."},{"key":"2255_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/rsa.10031","volume":"20","author":"S Janson","year":"2002","unstructured":"Janson, S., Ruci\u0144ski, A.: The infamous upper tail. Random Struct. Algor. 20, 317\u2013342 (2002)","journal-title":"Random Struct. Algor."},{"key":"2255_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10107-006-0719-3","volume":"108","author":"H Kaul","year":"2006","unstructured":"Kaul, H., Jacobson, S.H.: New global optima results for the Kauffman $$NK$$ Model : handling dependency. Math. Programm. 108, 475\u2013494 (2006). (Special issue on \u2018Optimization under Uncertainty\u2019)","journal-title":"Math. Programm."},{"key":"2255_CR10","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.disc.2019.05.011","volume":"342","author":"H Kaul","year":"2019","unstructured":"Kaul, H., Mudrock, J., Pelsmajer, M.J., Reiniger, B.: Proportional choosability: a new list analogue of equitable coloring. Discrete Math. 342, 2371\u20132383 (2019)","journal-title":"Discrete Math."},{"key":"2255_CR11","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00373-020-02146-z","volume":"36","author":"H Kaul","year":"2020","unstructured":"Kaul, H., Mudrock, J., Pelsmajer, M.J., Reiniger, B.: A simple characterization of proportionally 2-choosable graphs. Graphs Combina. 36, 679\u2013687 (2020)","journal-title":"Graphs Combina."},{"key":"2255_CR12","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1002\/rsa.20114","volume":"29","author":"M Krivelevich","year":"2006","unstructured":"Krivelevich, M., Nachmias, A.: Coloring complete bipartite graphs from random lists. Random Struct. Algor. 29, 436\u2013449 (2006)","journal-title":"Random Struct. Algor."},{"key":"2255_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/jgt.10137","volume":"44","author":"AV Kostochka","year":"2003","unstructured":"Kostochka, A.V., Pelsmajer, M.J., West, D.B.: A list analogue of equitable coloring. J. Graph Theory 44, 166\u2013177 (2003)","journal-title":"J. Graph Theory"},{"key":"2255_CR14","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1080\/00029890.1973.11993408","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. Am. Math. Monthly 80, 920\u2013922 (1973)","journal-title":"Am. Math. Monthly"},{"key":"2255_CR15","unstructured":"Mudrock, J.: On the list coloring problem and its equitable variants. Ph.D. Thesis, Illinois Institute of Technology, (2018)"},{"key":"2255_CR16","doi-asserted-by":"publisher","first-page":"3148","DOI":"10.1016\/j.disc.2018.08.003","volume":"341","author":"J Mudrock","year":"2018","unstructured":"Mudrock, J.: A note on the DP-chromatic number of complete bipartite graphs. Discrete Math. 341, 3148\u20133151 (2018)","journal-title":"Discrete Math."},{"key":"2255_CR17","unstructured":"Mudrock, J., Chase, M., Kadera, I., Wagstrom, T.: A note on the equitable choosability of complete bipartite graphs, to appear in Discussiones Mathematicae Graph Theory"},{"key":"2255_CR18","unstructured":"Mudrock, J., Piechota, R., Shin, P., Wagstrom, T.: Proportional 2-choosability with a bounded palette, arXiv:1910.03418 (preprint). (2019)"},{"key":"2255_CR19","volume-title":"The choice number of $$K_{6,q}$$","author":"P O\u2019Donnell","year":"1995","unstructured":"O\u2019Donnell, P.: The choice number of $$K_{6,q}$$. Rutgers University Mathematics Department, Camden (1995). (preprint)"},{"key":"2255_CR20","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V.: Equitable colorings extend Chernoff-Hoeffding bounds, pp. 285\u2013296. Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001), (2001)","DOI":"10.1007\/3-540-44666-4_31"},{"key":"2255_CR21","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A Tucker","year":"1973","unstructured":"Tucker, A.: Perfect graphs and an application to optimizing municipal services. SIAM Rev. 15, 585\u2013590 (1973)","journal-title":"SIAM Rev."},{"key":"2255_CR22","first-page":"3","volume":"101","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Vizing, Coloring the vertices of a graph in prescribed colors, Diskret. Analiz. no. 29. Metody Diskret. Anal. v Teorii Kodovi Skhem 101, 3\u201310 (1976)","journal-title":"Metody Diskret. Anal. v Teorii Kodovi Skhem"},{"key":"2255_CR23","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to graph theory. Prentice Hall, Upper Saddle River (2001)"},{"key":"2255_CR24","volume-title":"Combinatorial mathematics","author":"DB West","year":"2020","unstructured":"West, D.B.: Combinatorial mathematics. Cambridge University Press, New York (2020)"},{"key":"2255_CR25","volume-title":"On the equitable-coloring of the complete $$t$$-partite graphs, Master\u2019s thesis","author":"C-H Wu","year":"1994","unstructured":"Wu, C.-H.: On the equitable-coloring of the complete $$t$$-partite graphs, Master\u2019s thesis. Tunghai University, Taiwan (1994)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02255-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02255-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02255-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T16:27:19Z","timestamp":1610036839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02255-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2255"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02255-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,11,8]]},"assertion":[{"value":"26 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}