{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:17Z","timestamp":1720640777719},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1016\/j.endm.2013.10.040","type":"journal-article","created":{"date-parts":[[2013,11,4]],"date-time":"2013-11-04T09:23:27Z","timestamp":1383557007000},"page":"257-262","source":"Crossref","is-referenced-by-count":30,"special_numbering":"C","title":["Recoloring bounded treewidth graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"Marthe","family":"Bonamy","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Bousquet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2013.10.040_br0010","series-title":"Proceedings of the thirteenth southeastern conferenceon combinatorics, graph theory and computing","article-title":"A linear algorithm for the grundy number of a tree","author":"Beyer","year":"1982"},{"key":"10.1016\/j.endm.2013.10.040_br0020","first-page":"1","article-title":"Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs","author":"Bonamy","year":"2012","journal-title":"Journal of Combinatorial Optimization"},{"key":"10.1016\/j.endm.2013.10.040_br0030","series-title":"MFCS","first-page":"738","article-title":"Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances","volume":"vol. 4708","author":"Bonsma","year":"2007"},{"key":"10.1016\/j.endm.2013.10.040_br0040","series-title":"Mixing Graph Colourings","author":"Cereceda","year":"2007"},{"issue":"1","key":"10.1016\/j.endm.2013.10.040_br0050","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","article-title":"Some perfect coloring properties of graphs","volume":"27","author":"Christen","year":"1979","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10.1016\/j.endm.2013.10.040_br0060","article-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"2005"},{"key":"10.1016\/j.endm.2013.10.040_br0070","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1137\/07070440X","article-title":"The connectivity of boolean satisfiability: Computational and structural dichotomies","author":"Gopalan","year":"2009","journal-title":"SIAM J. Comput."},{"issue":"12\u201314","key":"10.1016\/j.endm.2013.10.040_br0080","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","article-title":"On the complexity of reconfiguration problems","volume":"412","author":"Ito","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.endm.2013.10.040_br0090","series-title":"Alg. & Data Struct","first-page":"375","article-title":"Reconfiguration of list edge-colorings in a graph","volume":"vol. 5664","author":"Ito","year":"2009"},{"issue":"2","key":"10.1016\/j.endm.2013.10.040_br0100","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 Structures & Algorithms"},{"issue":"23","key":"10.1016\/j.endm.2013.10.040_br0110","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.disc.2005.06.044","article-title":"Results on the grundy chromatic number of graphs","volume":"306","author":"Zaker","year":"2006","journal-title":"Discrete Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065313002564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065313002564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T22:26:29Z","timestamp":1539210389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065313002564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":11,"alternative-id":["S1571065313002564"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2013.10.040","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}