{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:31Z","timestamp":1759335931686,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T00:00:00Z","timestamp":1680566400000},"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":[[2023,5]]},"DOI":"10.1007\/s00373-023-02633-z","type":"journal-article","created":{"date-parts":[[2023,4,4]],"date-time":"2023-04-04T12:19:23Z","timestamp":1680610763000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-chromatic-Adherence of the DP Color Function via Generalized Theta Graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Manh Vu","family":"Bui","sequence":"first","affiliation":[]},{"given":"Hemanshu","family":"Kaul","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Maxfield","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Shin","sequence":"additional","affiliation":[]},{"given":"Seth","family":"Thomason","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,4]]},"reference":[{"key":"2633_CR1","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., Spivey, D., Thomason, S., Wagstrom, T.: The DP color function of joins and vertex-gluings of graphs. Discret. Math. 345, 113093 (2022)","journal-title":"Discret. Math."},{"key":"2633_CR2","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1016\/j.disc.2016.05.012","volume":"339","author":"A Bernshteyn","year":"2016","unstructured":"Bernshteyn, A.: The asymptotic behavior of the correspondence chromatic number. Discret. Math. 339, 2680\u20132692 (2016)","journal-title":"Discret. Math."},{"issue":"4","key":"2633_CR3","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1002\/rsa.20811","volume":"54","author":"A Bernshteyn","year":"2019","unstructured":"Bernshteyn, A.: The Johansson-Molloy theorem for DP-coloring. Random Struct. Algorithms 54(4), 653\u2013664 (2019)","journal-title":"Random Struct. Algorithms"},{"key":"2633_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1002\/jgt.22227","volume":"88","author":"A Bernshteyn","year":"2018","unstructured":"Bernshteyn, A., Kostochka, A.: Sharp Dirac\u2019s theorem for DP-critical graphs. J. Graph Theory 88, 521\u2013546 (2018)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2633_CR5","first-page":"61","volume":"21","author":"A Bernshteyn","year":"2018","unstructured":"Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring. Sib. Adv. Math. 21(2), 61\u201371 (2018)","journal-title":"Sib. Adv. Math."},{"issue":"8","key":"2633_CR6","doi-asserted-by":"publisher","first-page":"2100","DOI":"10.1016\/j.disc.2016.03.003","volume":"339","author":"J Beier","year":"2016","unstructured":"Beier, J., Fierson, J., Haas, R., Russel, H.M., Shavo, K.: Classifying coloring graphs. Discret. Math. 339(8), 2100\u20132112 (2016)","journal-title":"Discret. Math."},{"key":"2633_CR7","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":"2633_CR8","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jctb.2001.2057","volume":"83","author":"JI Brown","year":"2001","unstructured":"Brown, J.I., Hickman, C.A., Sokal, A.D., Wagner, D.G.: On the chromatic roots of generalized theta graphs. J. Comb. Theory Ser. B 83, 272\u2013297 (2001)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"5","key":"2633_CR9","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1007\/s00373-014-1441-1","volume":"31","author":"JM Carraher","year":"2015","unstructured":"Carraher, J.M., Mahoney, T., Puelo, G.J., West, D.B.: Sum-paintability of generalized theta-graphs. Graphs Comb. 31(5), 1325\u20131334 (2015)","journal-title":"Graphs Comb."},{"key":"2633_CR10","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":"2633_CR11","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. J. Graph Theory 16, 239\u2013245 (1992)","journal-title":"J. Graph Theory"},{"key":"2633_CR12","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. Comb. Theory Ser. B 129, 38\u201354 (2018)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2633_CR13","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":"2633_CR14","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 (preprint), (2020)"},{"key":"2633_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2020.102131","volume":"123","author":"H Kaul","year":"2021","unstructured":"Kaul, H., Mudrock, J.: On the chromatic polynomial and counting DP-colorings of graphs. Adv. Appl. Math. 123, 103121 (2021)","journal-title":"Adv. Appl. Math."},{"key":"2633_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112115","volume":"343","author":"H Kaul","year":"2020","unstructured":"Kaul, H., Mudrock, J.: Combinatorial Nullstellensatz and DP-coloring of graphs. Discret. Math. 343, 112115 (2020)","journal-title":"Discret. Math."},{"key":"2633_CR17","unstructured":"Kaul, H., Mudrock, J., Sharma, G., Stratton, Q.: DP-coloring the Cartesian products of graphs. J. Graph Theory"},{"issue":"2","key":"2633_CR18","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1002\/jgt.22425","volume":"91","author":"S-J Kim","year":"2019","unstructured":"Kim, S.-J., Ozeki, K.: A note on a Brooks\u2019 type theorem for DP-coloring. J. Graph Theory 91(2), 148\u2013161 (2019)","journal-title":"J. Graph Theory"},{"key":"2633_CR19","first-page":"329","volume":"124","author":"R Kirov","year":"2016","unstructured":"Kirov, R., Naimi, R.: List coloring and $$n$$-monophilic graphs. Ars Comb. 124, 329\u2013340 (2016)","journal-title":"Ars Comb."},{"key":"2633_CR20","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)"},{"key":"2633_CR21","first-page":"310","volume":"66","author":"D Laiche","year":"2016","unstructured":"Laiche, D., Bouchemakh, I., Sopena, \u00c9.: On the packing coloring of undirected and oriented generalized theta graphs. Australas. J. Comb. 66, 310\u2013329 (2016)","journal-title":"Australas. J. Comb."},{"key":"2633_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00373-018-1989-2","volume":"35","author":"R Li","year":"2019","unstructured":"Li, R., Broersma, H., Zhang, S.: Properly edge-colored theta graphs in edge-colored complete graphs. Graphs Comb. 35, 261\u2013286 (2019)","journal-title":"Graphs Comb."},{"key":"2633_CR23","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.disc.2018.09.025","volume":"342","author":"R Liu","year":"2019","unstructured":"Liu, R., Loeb, S., Yin, Y., Yu, G.: DP-3-coloring of some planar graphs. Discret. Math. 342, 178\u2013189 (2019)","journal-title":"Discret. Math."},{"key":"2633_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1002\/jgt.22796","volume":"100","author":"M Molloy","year":"2022","unstructured":"Molloy, M., Postle, L.: Asymptotically good edge correspondence colouring. J. Graph Theory 100, 559\u2013577 (2022)","journal-title":"J. Graph Theory"},{"key":"2633_CR25","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. Discret. Math. 341, 3148\u20133151 (2018)","journal-title":"Discret. Math."},{"key":"2633_CR26","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00373-022-02520-z","volume":"38","author":"J Mudrock","year":"2022","unstructured":"Mudrock, J.: A deletion-contraction relation for the DP color function. Graphs Comb. 38, 115 (2022)","journal-title":"Graphs Comb."},{"key":"2633_CR27","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.7151\/dmgt.2292","volume":"41","author":"J Mudrock","year":"2021","unstructured":"Mudrock, J., Marsh, M., Wagstrom, T.: On list equitable total colorings of the generalized theta graph. Discuss. Math. Graph Theory 41, 1215\u20131233 (2021)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2633_CR28","doi-asserted-by":"publisher","first-page":"P2.24","DOI":"10.37236\/9863","volume":"28","author":"J Mudrock","year":"2021","unstructured":"Mudrock, J., Thomason, S.: Answers to two questions on the DP color function. Elect. J. Comb. 28, P2.24 (2021)","journal-title":"Elect. J. Comb."},{"key":"2633_CR29","first-page":"29","volume":"59","author":"H Ruderman","year":"1952","unstructured":"Ruderman, H.: Two new inequalities. Am. Math. Mon. 59, 29\u201332 (1952)","journal-title":"Am. Math. Mon."},{"issue":"2","key":"2633_CR30","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s40009-018-0625-2","volume":"41","author":"G Sathiamoorthy","year":"2018","unstructured":"Sathiamoorthy, G., Janakiraman, T.N.: Graceful labeling of generalized theta graphs. Natl. Acad. Sci. Lett. 41(2), 121\u2013122 (2018)","journal-title":"Natl. Acad. Sci. Lett."},{"key":"2633_CR31","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/S0963548303006023","volume":"13","author":"AD Sokal","year":"2004","unstructured":"Sokal, A.D.: Chromatic roots are dense in the whole complex plane. Comb. Probab. Comput. 13, 221\u2013261 (2004)","journal-title":"Comb. Probab. Comput."},{"key":"2633_CR32","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. J. Comb. Theory Ser. B 99, 474\u2013479 (2009)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2633_CR33","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. No. 29, Metody Diskret. Anal. Teorii Kodovi Skhem 101, 3\u201310 (1976)","journal-title":"Diskret. Analiz. No. 29, Metody Diskret. Anal. Teorii Kodovi Skhem"},{"key":"2633_CR34","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. J. Comb. Theory Ser. B 122, 543\u2013549 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2633_CR35","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)"},{"issue":"2","key":"2633_CR36","first-page":"511","volume":"25","author":"CW Wu","year":"2022","unstructured":"Wu, C.W.: On rearrangement inequalities for multiple sequences. Math. Inequal. Appl. 25(2), 511\u2013534 (2022)","journal-title":"Math. Inequal. Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02633-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02633-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02633-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,28]],"date-time":"2023-05-28T17:01:45Z","timestamp":1685293305000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02633-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,4]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2633"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02633-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2023,4,4]]},"assertion":[{"value":"16 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Conflict of interest\/competing interests is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"42"}}