{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:25:08Z","timestamp":1759335908978,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1359165"],"award-info":[{"award-number":["DMS-1359165"]}],"id":[{"id":"10.13039\/501100008982","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":[[2019,1]]},"DOI":"10.1007\/s00373-018-1985-6","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T11:13:19Z","timestamp":1543403599000},"page":"239-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cut-Colorings in Coloring Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Prateek","family":"Bhakta","sequence":"first","affiliation":[]},{"given":"Benjamin Brett","family":"Buckner","sequence":"additional","affiliation":[]},{"given":"Lauren","family":"Farquhar","sequence":"additional","affiliation":[]},{"given":"Vikram","family":"Kamat","sequence":"additional","affiliation":[]},{"given":"Sara","family":"Krehbiel","sequence":"additional","affiliation":[]},{"given":"Heather M.","family":"Russell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"issue":"8","key":"1985_CR1","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., Russell, H.M., Shavo, K.: Classifying coloring graphs. Discrete Math. 339(8), 2100\u20132112 (2016)","journal-title":"Discrete Math."},{"issue":"5","key":"1985_CR2","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/j.disc.2007.07.028","volume":"308","author":"L Cereceda","year":"2008","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Connectedness of the graph of vertex-colourings. Discrete Math. 308(5), 913\u2013919 (2008)","journal-title":"Discrete Math."},{"issue":"7","key":"1985_CR3","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1016\/j.ejc.2009.03.011","volume":"30","author":"L Cereceda","year":"2009","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7), 1593\u20131606 (2009). \n                    https:\/\/doi.org\/10.1016\/j.ejc.2009.03.011","journal-title":"Eur. J. Comb."},{"issue":"1","key":"1985_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.20514","volume":"67","author":"L Cereceda","year":"2011","unstructured":"Cereceda, L., van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. J. Graph Theory 67(1), 69\u201382 (2011)","journal-title":"J. Graph Theory"},{"issue":"1","key":"1985_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.26493\/1855-3974.196.0df","volume":"4","author":"K Choo","year":"2011","unstructured":"Choo, K., MacGillivray, G.: Gray code numbers for graphs. Ars Math. Contemp. 4(1), 125\u2013139 (2011)","journal-title":"Ars Math. Contemp."},{"issue":"4","key":"1985_CR6","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1002\/rsa.20129","volume":"29","author":"M Dyer","year":"2006","unstructured":"Dyer, M., Flaxman, A.D., Frieze, A.M., Vigoda, E.: Randomly coloring sparse random graphs with fewer colors than the maximum degree. Random Struct. Algorithms 29(4), 450\u2013465 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"1985_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2016.08.016","volume":"651","author":"A Haddadan","year":"2016","unstructured":"Haddadan, A., Ito, T., Mouawad, A.E., Nishimura, N., Ono, H., Suzuki, A., Tebbal, Y.: The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651, 37\u201349 (2016). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2016.08.016","journal-title":"Theor. Comput. Sci."},{"issue":"12\u201314","key":"1985_CR8","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2010.12.005","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1985_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M Jerrum","year":"1995","unstructured":"Jerrum, M.: A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Struct. Algorithms 7(2), 157\u2013165 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"1985_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S0097539799360355","volume":"31","author":"M Luby","year":"2001","unstructured":"Luby, M., Randall, D., Sinclair, A.J.: Markov chain algorithms for planar lattice structures. SIAM J. Comput. 31, 167\u2013192 (2001)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1985_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/S0097539702401786","volume":"33","author":"M Molloy","year":"2004","unstructured":"Molloy, M.: The glauber dynamics on colorings of a graph with high girth and maximum degree. SIAM J. Comput. 33(3), 721\u2013737 (2004)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1985_CR12","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1063\/1.533196","volume":"41","author":"E Vigoda","year":"2000","unstructured":"Vigoda, E.: Improved bounds for sampling colorings. J. Math. Phys. 41(3), 1555\u20131569 (2000)","journal-title":"J. Math. Phys."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1985-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1985-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1985-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:39:21Z","timestamp":1574883561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1985-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["1985"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1985-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"13 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}