{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:04:27Z","timestamp":1755799467313,"version":"3.44.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T00:00:00Z","timestamp":1537833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["524418"],"award-info":[{"award-number":["524418"]}],"id":[{"id":"10.13039\/100000893","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":[[2018,11]]},"DOI":"10.1007\/s00373-018-1951-3","type":"journal-article","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T05:59:27Z","timestamp":1537855167000},"page":"1347-1361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Extremal Colorings and Independent Sets"],"prefix":"10.1007","volume":"34","author":[{"given":"John","family":"Engbers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aysel","family":"Erey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,25]]},"reference":[{"issue":"3","key":"1951_CR1","doi-asserted-by":"crossref","first-page":"#P37","DOI":"10.37236\/2722","volume":"19","author":"J Alexander","year":"2012","unstructured":"Alexander, J., Cutler, J., Mink, T.: Independent sets in graphs with given minimum degree. Electron. J. Combin. 19(3), #P37 (2012)","journal-title":"Electron. J. Combin."},{"issue":"11","key":"1951_CR2","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1016\/j.disc.2015.04.021","volume":"338","author":"J Brown","year":"2015","unstructured":"Brown, J., Erey, A.: New bounds for chromatic polynomials and chromatic roots. Discrete Math. 338(11), 1938\u20131946 (2015)","journal-title":"Discrete Math."},{"issue":"1","key":"1951_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"1951_CR4","first-page":"7","volume":"63","author":"J Cutler","year":"2012","unstructured":"Cutler, J.: Coloring graphs with graphs: a survey. Graph Theory Notes N.Y. 63, 7\u201316 (2012)","journal-title":"Graph Theory Notes N.Y."},{"issue":"1","key":"1951_CR5","doi-asserted-by":"crossref","first-page":"#P169","DOI":"10.37236\/656","volume":"18","author":"J Cutler","year":"2011","unstructured":"Cutler, J., Radcliffe, A.J.: Extremal problems for independent set enumeration. Electron. J. Combin. 18(1), #P169 (2011)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"1951_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/rsa.20767","volume":"53","author":"E Davies","year":"2018","unstructured":"Davies, E., Jenssen, M., Perkins, W., Roberts, B.: Extremes of the internal energy of the Potts model on cubic graphs. Random Struct. Algorithms 53(1), 59\u201375 (2018). arXiv:1610.08496","journal-title":"Random Struct. Algorithms"},{"key":"1951_CR7","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, London (2005)"},{"key":"1951_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/jgt.21820","volume":"79","author":"J Engbers","year":"2015","unstructured":"Engbers, J.: Extremal $$H$$ H -colorings of graphs with fixed minimum degree. J. Graph Theory 79, 103\u2013124 (2015)","journal-title":"J. Graph Theory"},{"key":"1951_CR9","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1002\/jgt.22105","volume":"85","author":"J Engbers","year":"2017","unstructured":"Engbers, J.: Maximizing $$H$$ H -colorings of connected graphs with fixed minimum degree. J. Graph Theory 85, 780\u2013787 (2017)","journal-title":"J. Graph Theory"},{"key":"1951_CR10","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.jctb.2016.09.009","volume":"122","author":"J Engbers","year":"2017","unstructured":"Engbers, J., Galvin, D.: Extremal $$H$$ H -colorings of trees and 2-connected graphs. J. Combin. Theory Ser. B 122, 800\u2013814 (2017)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"1951_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.4310\/JOC.2018.v9.n3.a4","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). arXiv:1610.07208","journal-title":"J. Combin."},{"issue":"5","key":"1951_CR12","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.disc.2017.09.028","volume":"341","author":"A Erey","year":"2018","unstructured":"Erey, A.: Maximizing the number of $$x$$ x -colorings of $$4$$ 4 -chromatic graphs. Discrete Math. 341(5), 1419\u20131431 (2018). https:\/\/doi.org\/10.1016\/j.disc.2017.09.028","journal-title":"Discrete Math."},{"key":"1951_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1017\/S0963548311000708","volume":"21","author":"RJ Faudree","year":"2012","unstructured":"Faudree, R.J., Gould, R.J., Jacobson, M.S.: Minimum degree and disjoint cycles in claw-free graphs. Combin. Probab. Comput. 21, 129\u2013139 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"1951_CR14","unstructured":"Fox, J., He, X., Manners, F.: A proof of Tomescu\u2019s graph coloring conjecture. arXiv:1712.06067"},{"key":"1951_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/jgt.21658","volume":"73","author":"D Galvin","year":"2013","unstructured":"Galvin, D.: Maximizing $$H$$ H -colorings of regular graphs. J. Graph Theory 73, 66\u201384 (2013)","journal-title":"J. Graph Theory"},{"key":"1951_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00373-013-1403-z","volume":"31","author":"D Galvin","year":"2015","unstructured":"Galvin, D.: Counting colorings of a regular graph. Graphs Combin. 31, 629\u2013638 (2015)","journal-title":"Graphs Combin."},{"key":"1951_CR17","first-page":"97","volume-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"David Galvin","year":"2004","unstructured":"Galvin, D., Tetali, P.: On weighted graph homomorphisms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 63 (2004) Graphs, Morphisms and Statistical Physics, 97104"},{"key":"1951_CR18","unstructured":"Guggiari, H., Scott, A.: Maximising $$H$$ H -colourings of graphs. arXiv:1611.02911"},{"key":"1951_CR19","unstructured":"Knox F., Mohar, B.: Maximum number of colourings. I. 4-chromatic graphs. arXiv:1708.01781"},{"key":"1951_CR20","unstructured":"Knox, F., Mohar, B.: Maximum number of colourings. II. 5-chromatic graphs. arXiv: 1710.06535"},{"key":"1951_CR21","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1007\/s10878-016-0037-5","volume":"33","author":"S Li","year":"2017","unstructured":"Li, S., Liu, L., Wu, Y.: On the coefficients of the independence polynomial of graphs. J. Combin. Optim. 33, 1324\u20131342 (2017)","journal-title":"J. Combin. Optim."},{"key":"1951_CR22","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1112\/plms\/pdp041","volume":"101","author":"P-S Loh","year":"2010","unstructured":"Loh, P.-S., Pikhurko, O., Sudakov, B.: Maximizing the number of $$q$$ q -colorings. Proc. Lond. Math. Soc. 101, 655\u2013696 (2010)","journal-title":"Proc. Lond. Math. Soc."},{"key":"1951_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jctb.2015.07.002","volume":"115","author":"J Ma","year":"2015","unstructured":"Ma, J., Naves, H.: Maximizing proper colorings on graphs. J. Combin. Theory Ser. B 115, 236\u2013275 (2015)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1951_CR24","volume-title":"Topological Methods in Chemistry","author":"R Merrifield","year":"1989","unstructured":"Merrifield, R., Simmons, H.: Topological Methods in Chemistry. Wiley, New York (1989)"},{"key":"1951_CR25","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1080\/00150517.1982.12430021","volume":"20","author":"H Prodinger","year":"1982","unstructured":"Prodinger, H., Tichy, R.: Fibonacci numbers of graphs. Fibonacci Q. 20, 16\u201321 (1982)","journal-title":"Fibonacci Q."},{"key":"1951_CR26","first-page":"1124","volume":"273","author":"I Tomescu","year":"1971","unstructured":"Tomescu, I.: Le nombre des graphes connexes k-chromatiques minimaux aux sommets \u00e9tiquet\u00e9s. C. R. Acad. Sci. Paris 273, 1124\u20131126 (1971)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1951_CR27","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0012-365X(72)90042-8","volume":"1","author":"I Tomescu","year":"1972","unstructured":"Tomescu, I.: Le nombre maximal de 3-colorations dun graphe connnexe. Discrete Math. 1, 351\u2013356 (1972)","journal-title":"Discrete Math."},{"key":"1951_CR28","volume-title":"Introduction to Combinatorics","author":"I Tomescu","year":"1975","unstructured":"Tomescu, I.: Introduction to Combinatorics. Collets (Publishers) Ltd., London (1975)"},{"key":"1951_CR29","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190140111","volume":"14","author":"I Tomescu","year":"1990","unstructured":"Tomescu, I.: Maximal chromatic polynomials of connected planar graphs. J. Graph Theory 14, 101\u2013110 (1990)","journal-title":"J. Graph Theory"},{"key":"1951_CR30","volume-title":"Properties and Applications of the Fibonacci Polynomial of a Graph, Ph.D. thesis","author":"G Wingard","year":"1995","unstructured":"Wingard, G.: Properties and Applications of the Fibonacci Polynomial of a Graph, Ph.D. thesis. University of Mississippi, Oxford (1995)"},{"key":"1951_CR31","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.aml.2009.11.005","volume":"23","author":"K Xu","year":"2010","unstructured":"Xu, K.: On the Hosoya index and the Merrifield\u2013Simmons index of graphs with a given clique number. Appl. Math. Lett. 23, 395\u2013398 (2010)","journal-title":"Appl. Math. Lett."},{"key":"1951_CR32","doi-asserted-by":"publisher","first-page":"827","DOI":"10.4169\/amer.math.monthly.124.9.827","volume":"124","author":"Y Zhao","year":"2017","unstructured":"Zhao, Y.: Extremal regular graphs: independent sets and graph homomorphisms. Amer. Math. Mon. 124, 827\u2013843 (2017). arXiv:1610.09210","journal-title":"Amer. Math. Mon."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1951-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1951-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1951-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T21:46:24Z","timestamp":1755639984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1951-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,25]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1951"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1951-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,9,25]]},"assertion":[{"value":"8 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}