{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:08Z","timestamp":1740107108294,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00373-021-02448-w","type":"journal-article","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T14:02:38Z","timestamp":1640181758000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Proportional 2-Choosability with a Bounded Palette"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"first","affiliation":[]},{"given":"Robert","family":"Piechota","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wagstrom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,22]]},"reference":[{"key":"2448_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/jgt.22013","volume":"84","author":"M Bonamy","year":"2017","unstructured":"Bonamy, M., Kang, R.: List coloring with a bounded palette. J. Graph Theory 84, 93\u2013103 (2017)","journal-title":"J. Graph Theory"},{"key":"2448_CR2","unstructured":"Demange, M., de Werra, D.: Complexity of choosability with a small palette of colors. (preprint) (2017) arXiv:1601.01768"},{"key":"2448_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":"2448_CR4","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Cong. Numer. 26, 125\u2013127 (1979)","journal-title":"Cong. Numer."},{"key":"2448_CR5","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":"2448_CR6","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. Rand. Struct. Algorithms 20, 317\u2013342 (2002)","journal-title":"Rand. Struct. Algorithms"},{"key":"2448_CR7","first-page":"475","volume":"108","author":"H Kaul","year":"2006","unstructured":"Kaul, H., Jacobson, S.H.: New global optima results for the Kauffman $$NK$$ model: handling dependency, mathematical programming. Spec. Issue Optim. Under Uncert. 108, 475\u2013494 (2006)","journal-title":"Spec. Issue Optim. Under Uncert."},{"key":"2448_CR8","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., Reiniger, B.: Proportional choosability: a new list analogue of equitable coloring. Disc. Math. 342, 2371\u20132383 (2019)","journal-title":"Disc. Math."},{"key":"2448_CR9","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 Combin. 36, 679\u2013687 (2020)","journal-title":"Graphs Combin."},{"key":"2448_CR10","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":"2448_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/jgt.20073","volume":"49","author":"D Kr\u00e1l","year":"2005","unstructured":"Kr\u00e1l, D., Sgall, J.: Coloring graphs from lists with bounded size of their union. J. Graph Theory 49, 177\u2013186 (2005)","journal-title":"J. Graph Theory"},{"key":"2448_CR12","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. Mon. 80, 920\u2013922 (1973)","journal-title":"Am. Math. Mon."},{"key":"2448_CR13","unstructured":"Mudrock, J.: On the list coloring problem and its equitable variants, Ph.D. Thesis, Illinois Institute of Technology (2018)"},{"key":"2448_CR14","doi-asserted-by":"crossref","unstructured":"Mudrock, J., Piechota, R., Shin, P., Wagstrom, T.: Proportional 2-choosability with a bounded palette. (preprint) (2020) arXiv:1910.03418","DOI":"10.1007\/s00373-021-02448-w"},{"key":"2448_CR15","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V.: Equitable colorings extend Chernoff\u2013Hoeffding bounds, In: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001), 285-296 (2001)","DOI":"10.1007\/3-540-44666-4_31"},{"key":"2448_CR16","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."},{"issue":"29","key":"2448_CR17","first-page":"3","volume":"101","author":"VG Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. Metody Diskret. Anal. v Teorii Kodovi Skhem 101(29), 3\u201310 (1976)","journal-title":"Diskret. Analiz. Metody Diskret. Anal. v Teorii Kodovi Skhem"},{"key":"2448_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 (2001)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02448-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02448-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02448-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,8]],"date-time":"2022-03-08T17:06:28Z","timestamp":1646759188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02448-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,22]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["2448"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02448-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,12,22]]},"assertion":[{"value":"2 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"23"}}