{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T01:34:24Z","timestamp":1722303264744},"reference-count":7,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":1720,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Graph Theory"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1002\/jgt.20514","type":"journal-article","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T00:11:26Z","timestamp":1292544686000},"page":"69-82","source":"Crossref","is-referenced-by-count":95,"title":["Finding paths between 3-colorings"],"prefix":"10.1002","volume":"67","author":[{"given":"Luis","family":"Cereceda","sequence":"first","affiliation":[]},{"given":"Jan","family":"van den Heuvel","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"key":"10.1002\/jgt.20514-BIB1|cit1","unstructured":"J. Billingham R. Leese H. Rajaniemi http:\/\/www.smithinst.ac.uk\/Projects\/ESGI53\/ESGI53-Motorola\/Report\/"},{"key":"10.1002\/jgt.20514-BIB2|cit2","doi-asserted-by":"crossref","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","article-title":"Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances","volume":"410","author":"Bonsma","year":"2009","journal-title":"Theoret Comput Sci"},{"key":"10.1002\/jgt.20514-BIB3|cit3","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.ejc.2009.03.011","article-title":"Mixing 3-colourings in bipartite graphs","volume":"30","author":"Cereceda","year":"2009","journal-title":"Eur J Combin"},{"key":"10.1002\/jgt.20514-BIB4|cit4","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1016\/j.disc.2007.07.028","article-title":"Connectedness of the graph of vertex-colourings","volume":"308","author":"Cereceda","year":"2008","journal-title":"Discrete Math"},{"key":"10.1002\/jgt.20514-BIB5|cit5","volume-title":"Graph Theory","author":"Diestel","year":"2005"},{"key":"10.1002\/jgt.20514-BIB6|cit6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/rsa.3240070205","article-title":"A very simple algorithm for estimating the number of k-colorings of a low degree graph","volume":"7","author":"Jerrum","year":"1995","journal-title":"Random Struct Algor"},{"key":"10.1002\/jgt.20514-BIB7|cit7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8005-3","volume-title":"Counting, Sampling and Integrating: Algorithms and Complexity","author":"Jerrum","year":"2003"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.20514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/onlinelibrary.wiley.com\/wol1\/doi\/10.1002\/jgt.20514\/fullpdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T07:25:58Z","timestamp":1625469958000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.20514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"URL":"https:\/\/doi.org\/10.1002\/jgt.20514","relation":{},"ISSN":["0364-9024"],"issn-type":[{"value":"0364-9024","type":"print"}],"subject":[],"published":{"date-parts":[[2010,12,16]]}}}