{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:30:31Z","timestamp":1776133831708,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971346"],"award-info":[{"award-number":["11971346"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00373-024-02794-5","type":"journal-article","created":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T02:01:29Z","timestamp":1716170489000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounds for DP Color Function and Canonical Labelings"],"prefix":"10.1007","volume":"40","author":[{"given":"Ziqing","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9666-5167","authenticated-orcid":false,"given":"Yan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,20]]},"reference":[{"key":"2794_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112471","volume":"344","author":"T Abe","year":"2021","unstructured":"Abe, T.: Differences between the list-coloring and DP-coloring for planar graphs. Discrete Math. 344, 112471 (2021)","journal-title":"Discrete Math."},{"issue":"11","key":"2794_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113093","volume":"345","author":"J Becker","year":"2022","unstructured":"Becker, J., Hewitt, J., Kaul, H., Maxfield, M., Mudrock, J.A., Spivey, D., Thomason, S., Wagstrom, T.: The DP color function of joins and vertex-gluings of graphs. Discrete Math. 345(11), 113093 (2022)","journal-title":"Discrete Math."},{"key":"2794_CR3","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. Ann. Math. 14, 42\u201346 (1912)","journal-title":"Ann. Math."},{"key":"2794_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/5814","volume-title":"Chromatic Polynomials and Chromaticity of Graphs","author":"FM Dong","year":"2005","unstructured":"Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials and Chromaticity of Graphs. World Scientific, Singapore (2005)"},{"key":"2794_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2021.102301","volume":"134","author":"FM Dong","year":"2022","unstructured":"Dong, F.M., Yang, Y.: DP color functions versus chromatic polynomials. Adv. Appl. Math. 134, 102301 (2022)","journal-title":"Adv. Appl. Math."},{"key":"2794_CR6","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. J. Combin. Theory Ser. B 129, 38\u201354 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2794_CR7","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/19M1306646","volume":"35","author":"J Engbers","year":"2021","unstructured":"Engbers, J., Erey, A., Fox, J., He, X.Y.: Tomescu\u2019s graph coloring conjecture for $$l$$-connected graphs. SIAM J. Discrete. Math. 35(2), 1478\u20131502 (2021)","journal-title":"SIAM J. Discrete. Math."},{"key":"2794_CR8","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.disc.2017.09.028","volume":"341","author":"A Erey","year":"2008","unstructured":"Erey, A.: Maximizing the number of $$x$$-colorings of 4-chromatic graphs. Discrete Math. 341, 1419\u20131431 (2008)","journal-title":"Discrete Math."},{"issue":"3","key":"2794_CR9","first-page":"489","volume":"9","author":"A Erey","year":"2018","unstructured":"Erey, A.: On the maximum number of colorings of a graph. J. Combin. 9(3), 489\u2013497 (2018)","journal-title":"J. Combin."},{"issue":"10","key":"2794_CR10","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1016\/j.disc.2018.08.010","volume":"342","author":"L Felix","year":"2019","unstructured":"Felix, L.: The maximum number of colorings of graphs of given order and size: a survey. Discrete Math. 342(10), 2783\u20132791 (2019)","journal-title":"Discrete Math."},{"key":"2794_CR11","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.jctb.2018.10.005","volume":"136","author":"J Fox","year":"2019","unstructured":"Fox, J., He, X., Manners, F.: A proof of Tomescu\u2019s graph coloring conjecture. J. Combin. Theory Ser. B 136, 204\u2013221 (2019)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2794_CR12","unstructured":"Halberg, C., Kaul, H., Liu, A., Mudrock, J.A., Shin, P., Thomason, S.: On polynomial representations of the DP color function: theta graphs and their generalizations. arXiv:2012.12897 (2020)"},{"issue":"2","key":"2794_CR13","first-page":"S2R11","volume":"4","author":"H Kaul","year":"2024","unstructured":"Kaul, H., Maxfield, M., Mudrock, J.A., Thomason, S.: The DP color function of clique-Gluings of graphs. Enumer. Comb. Appl. 4(2), S2R11 (2024)","journal-title":"Enumer. Comb. Appl."},{"key":"2794_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":"2","key":"2794_CR15","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1002\/jgt.22917","volume":"103","author":"H Kaul","year":"2023","unstructured":"Kaul, H., Mudrock, J.A., Sharma, G., Stratton, Q.: DP-coloring Cartesian product of graphs. J. Graph Theory 103(2), 285\u2013306 (2023)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2794_CR16","doi-asserted-by":"publisher","first-page":"3.40","DOI":"10.37236\/7879","volume":"26","author":"F Knox","year":"2019","unstructured":"Knox, F., Mohar, B.: Maximum number of colourings: 5-chromatic case. Electron. J. Combin. 26(3), 3.40 (2019)","journal-title":"Electron. J. Combin."},{"key":"2794_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jctb.2020.01.002","volume":"144","author":"F Knox","year":"2020","unstructured":"Knox, F., Mohar, B.: Maximum number of colourings: 4-chromatic graphs. J. Combin. Theory Ser. B 144, 95\u2013118 (2020)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"4","key":"2794_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 Combin. 38(4), 115 (2022)","journal-title":"Graphs Combin."},{"issue":"2","key":"2794_CR19","doi-asserted-by":"publisher","first-page":"2.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. Electron. J. Combin. 28(2), 2.24 (2021)","journal-title":"Electron. J. Combin."},{"key":"2794_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/jgt.3190180404","volume":"18","author":"I Tomescu","year":"1994","unstructured":"Tomescu, I.: Maximum chromatic polynomials of 2-connected graphs. J. Graph Theory 18, 329\u2013336 (1994)","journal-title":"J. Graph Theory"},{"key":"2794_CR21","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New York (2001)","edition":"2"},{"issue":"4","key":"2794_CR22","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1002\/jgt.22944","volume":"103","author":"MQ Zhang","year":"2023","unstructured":"Zhang, M.Q., Dong, F.M.: DP color functions versus chromatic polynomials (II). J. Graph Theory 103(4), 740\u2013761 (2023)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02794-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02794-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02794-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:03:30Z","timestamp":1723230210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02794-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2794"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02794-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,20]]},"assertion":[{"value":"14 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"65"}}