{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T03:54:20Z","timestamp":1776052460967,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T00:00:00Z","timestamp":1776038400000},"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-03040-w","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T03:37:22Z","timestamp":1776051442000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shameful Inequalities for List and DP Coloring of Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Hemanshu","family":"Kaul","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"additional","affiliation":[]},{"given":"Gunjan","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"key":"3040_CR1","unstructured":"S. Allred and J. A. Mudrock, Enumerative Chromatic Choosability, arXiv: 2505.05662 (2025)"},{"key":"3040_CR2","doi-asserted-by":"crossref","unstructured":"J. E. Bartels and D. Welsh, The markov chain of colourings,  In Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization (1995), 373-387. Springer-Verlag","DOI":"10.1007\/3-540-59408-6_66"},{"key":"3040_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":"3040_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.2307\/1967597","volume":"14","author":"GD Birkhoff","year":"1912","unstructured":"Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. The Annals of Mathematics 14, 42\u201346 (1912)","journal-title":"The Annals of Mathematics"},{"key":"3040_CR5","unstructured":"S. L. Dahlberg, H. Kaul, J. Mudrock, A Polynomial Method for Counting Colorings of Sparse Graphs, arXiv: 2312.11744 (2023)"},{"key":"3040_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/jctb.1999.1925","volume":"78","author":"F Dong","year":"2000","unstructured":"Dong, F.: Proof of a chromatic polynomial conjecture. Journal of Combinatorial Theory, Series B 78, 35\u201344 (2000)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3040_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2021.102301","volume":"134","author":"F Dong","year":"2022","unstructured":"Dong, F., Yang, Y.: DP color functions versus chromatic polynomials. Adv. Appl. Math. 134, 102301 (2022)","journal-title":"Adv. Appl. Math."},{"key":"3040_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.jctb.2023.02.002","volume":"161","author":"F Dong","year":"2023","unstructured":"Dong, F., Zhang, M.: An improved lower bound of $$P(G, L)-P(G, k)$$ for $$k$$-assignments $$L$$. Journal of Combinatorial Theory Series B 161, 109\u2013119 (2023)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"3040_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.3190160307","volume":"16","author":"Q Donner","year":"1992","unstructured":"Donner, Q.: On the number of list-colorings. Journal of Graph Theory 16, 239\u2013245 (1992)","journal-title":"Journal of Graph Theory"},{"key":"3040_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jctb.2017.09.001","volume":"129","author":"Z Dvo\u0159\u00e1k","year":"2018","unstructured":"Dvo\u0159\u00e1k, Z., Postle, L.: Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. Journal of Combinatorial Theory Series B 129, 38\u201354 (2018)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"3040_CR11","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."},{"key":"3040_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ejc.2015.02.001","volume":"47","author":"S Fadnavis","year":"2015","unstructured":"Fadnavis, S.: A note on the shameful conjecture. Eur. J. Comb. 47, 115\u2013122 (2015)","journal-title":"Eur. J. Comb."},{"issue":"5","key":"3040_CR13","doi-asserted-by":"publisher","first-page":"849","DOI":"10.2140\/involve.2023.16.849","volume":"16","author":"H Kaul","year":"2022","unstructured":"Kaul, H., Kumar, A., Liu, A., Mudrock, J.A., Rewers, P., Shin, P., Tanahara, M.S., To, K.: Bounding the List Color Function Threshold from Above. Involve, a Journal of Mathematics 16(5), 849\u2013882 (2022)","journal-title":"Involve, a Journal of Mathematics"},{"key":"3040_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2020.102131","volume":"123","author":"H Kaul","year":"2021","unstructured":"Kaul, H., Mudrock, J.A.: On the chromatic polynomial and counting DP-colorings of graphs. Adv. Appl. Math. 123, 103121 (2021)","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"3040_CR15","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.A.: Criticality, the list color function, and list coloring the Cartesian product of graphs. Journal of Combinatorics 12(3), 479\u2013514 (2021)","journal-title":"Journal of Combinatorics"},{"key":"3040_CR16","first-page":"329","volume":"124","author":"R Kirov","year":"2016","unstructured":"Kirov, R., Naimi, R.: List coloring and $$n$$-monophilic graphs. Ars Combin. 124, 329\u2013340 (2016)","journal-title":"Ars Combin."},{"key":"3040_CR17","first-page":"380","volume":"51","author":"AV Kostochka","year":"1992","unstructured":"Kostochka, A.V., Sidorenko, A.: Problem Session of the Prachatice Conference on Graph Theory. Fourth Czechoslovak Symposium on Combinatorics, Graphs and Complexity. Ann. Discrete Math 51, 380 (1992)","journal-title":"Fourth Czechoslovak Symposium on Combinatorics, Graphs and Complexity. Ann. Discrete Math"},{"key":"3040_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00373-022-02520-z","volume":"38","author":"JA Mudrock","year":"2022","unstructured":"Mudrock, J.A.: A deletion-contraction relation for the DP color function. Graphs and Combinatorics 38, 115 (2022)","journal-title":"Graphs and Combinatorics"},{"key":"3040_CR19","doi-asserted-by":"crossref","unstructured":"Mudrock, J.A., Sharbel, G.: On polynomial representations of dual DP color functions. Discussiones Mathematicae Graph Theory 46(1), 67\u201390 (2026)","DOI":"10.7151\/dmgt.2593"},{"key":"3040_CR20","doi-asserted-by":"publisher","first-page":"P2.24","DOI":"10.37236\/9863","volume":"28","author":"JA Mudrock","year":"2021","unstructured":"Mudrock, J.A., Thomason, S.: Answers to two questions on the DP color function. Elect. Journal of Combinatorics 28, P2.24 (2021)","journal-title":"Elect. Journal of Combinatorics"},{"key":"3040_CR21","first-page":"29","volume":"59","author":"H Ruderman","year":"1952","unstructured":"Ruderman, H.: Two new inequalities. Amer. Math. Monthly 59, 29\u201332 (1952)","journal-title":"Amer. Math. Monthly"},{"key":"3040_CR22","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1749","volume":"70","author":"P Seymour","year":"1997","unstructured":"Seymour, P.: Two chromatic polynomial conjectures. Journal of Combinatorial Theory Series B 70, 184\u2013196 (1997)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"3040_CR23","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.jctb.2008.09.005","volume":"99","author":"C Thomassen","year":"2009","unstructured":"Thomassen, C.: The chromatic polynomial and list colorings. Journal of Combinatorial Theory, Series B 99, 474\u2013479 (2009)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3040_CR24","unstructured":"V. G. Vizing, Coloring the vertices of a graph in prescribed colors, Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem 101 (1976), 3-10"},{"key":"3040_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.jctb.2016.08.002","volume":"122","author":"W Wang","year":"2017","unstructured":"Wang, W., Qian, J., Yan, Z.: When does the list-coloring function of a graph equal its chromatic polynomial. Journal of Combinatorial Theory Series B 122, 543\u2013549 (2017)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"3040_CR26","volume-title":"Introduction to Graph Theory, Upper Saddle River","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, Upper Saddle River. Prentice Hall, NJ (2001)"},{"key":"3040_CR27","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1002\/jgt.22944","volume":"103","author":"M Zhang","year":"2023","unstructured":"Zhang, M., Dong, F.: DP color functions versus chromatic polynomials (II). Journal of Graph Theory 103, 740\u2013761 (2023)","journal-title":"Journal of Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03040-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03040-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03040-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T03:37:26Z","timestamp":1776051446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03040-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3040"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03040-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]},"assertion":[{"value":"3 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 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":"Funding is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"Conflicts of interest\/competing interests is not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest\/Competing Interests"}},{"value":"Availability of data and material is not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of Data and Materials"}},{"value":"Code availability is not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}}],"article-number":"46"}}