{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:52:37Z","timestamp":1742917957204,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_25","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"287-298","source":"Crossref","is-referenced-by-count":0,"title":["A Reconfigurations Analogue of Brooks\u2019 Theorem"],"prefix":"10.1007","author":[{"given":"Carl","family":"Feghali","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bonamy, M., Bousquet, N.: Recoloring bounded treewidth graphs. In: Proc. LAGOS 2013. Electronic Notes in Discrete Mathematics, vol.\u00a044, pp. 257\u2013262 (2013)","DOI":"10.1016\/j.endm.2013.10.040"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/s10878-012-9490-y","volume":"27","author":"M. Bonamy","year":"2014","unstructured":"Bonamy, M., Johnson, M., Lignos, I.M., Patel, V., Paulusma, D.: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Journal of Combinatorial Optimization\u00a027, 132\u2013143 (2014)","journal-title":"Journal of Combinatorial Optimization"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-32589-2_22","volume-title":"Mathematical Foundations of Computer Science 2012","author":"P. Bonsma","year":"2012","unstructured":"Bonsma, P.: The complexity of rerouting shortest paths. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 222\u2013233. Springer, Heidelberg (2012)"},{"key":"25_CR4","unstructured":"Bonsma, P.: Rerouting shortest paths in planar graphs. In: Proc. FSTTCS 2012. LIPIcs, vol.\u00a018, pp. 337\u2013349 (2012)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"5215","DOI":"10.1016\/j.tcs.2009.08.023","volume":"410","author":"P. Bonsma","year":"2009","unstructured":"Bonsma, P., Cereceda, L.: Finding paths between graph colourings: Pspace-completeness and superpolynomial distances. Theoretical Computer Science\u00a0410, 5215\u20135226 (2009)","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Kami\u0144ski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. arXiv, 1403.0359 (2014)","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bonsma, P., Mouawad, A.: The complexity of bounded length graph recoloring. arXiv, 1404.0337 (2014)","DOI":"10.1007\/978-3-319-13524-3_10"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society\u00a037, 194\u2013197 (1941)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"25_CR9","unstructured":"Cereceda, L.: Mixing graph colourings. PhD thesis, London School of Economics (2007)"},{"key":"25_CR10","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 Mathematics\u00a0308, 913\u2013919 (2008)","journal-title":"Discrete Mathematics"},{"issue":"7","key":"25_CR11","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. European Journal of Combinatorics\u00a030(7), 1593\u20131606 (2009)","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"25_CR12","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. Journal of Graph Theory\u00a067(1), 69\u201382 (2011)","journal-title":"Journal of Graph Theory"},{"issue":"6","key":"25_CR13","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1137\/07070440X","volume":"38","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., Kolaitis, P.G., Maneva, E.N., Papadimitriou, C.H.: The connectivity of boolean satisfiability: Computational and structural dichotomies. SIAM Journal on Computing\u00a038(6), 2330\u20132355 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR14","unstructured":"van den Heuvel, J.: The complexity of change. In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Surveys in Combinatorics 2013, London. Mathematical Society Lecture Notes Series, vol.\u00a0409 (2013)"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-642-20877-5_7","volume-title":"Theory and Applications of Models of Computation","author":"T. Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D.: Approximability of the subset sum reconfiguration problem. In: Ogihara, M., Tarui, J. (eds.) TAMC 2011. LNCS, vol.\u00a06648, pp. 58\u201369. Springer, Heidelberg (2011)"},{"issue":"12-14","key":"25_CR16","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. Theoretical Computer Science\u00a0412(12-14), 1054\u20131065 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"15","key":"25_CR17","doi-asserted-by":"publisher","first-page":"2199","DOI":"10.1016\/j.dam.2012.05.014","volume":"160","author":"T. Ito","year":"2012","unstructured":"Ito, T., Kaminski, M., Demaine, E.D.: Reconfiguration of list edge-colorings in a graph. Discrete Applied Mathematics\u00a0160(15), 2199\u20132207 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR18","unstructured":"Johnson, M., Kratsch, D., Kratsch, S., Patel, V., Paulusma, D.: Colouring reconfiguration is fixed-parameter tractable. arXiv, 1403.6347 (2014)"},{"issue":"39","key":"25_CR19","doi-asserted-by":"publisher","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M. Kaminski","year":"2011","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Shortest paths between shortest paths. Theoretical Computer Science\u00a0412(39), 5205\u20135210 (2011)","journal-title":"Theoretical Computer Science"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M. Kaminski","year":"2012","unstructured":"Kaminski, M., Medvedev, P., Milanic, M.: Complexity of independent set reconfigurability problems. Theoretical Computer Science\u00a0439, 9\u201315 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"18","key":"25_CR21","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1016\/j.dam.2010.08.019","volume":"158","author":"K. Makino","year":"2010","unstructured":"Makino, K., Tamaki, S., Yamamoto, M.: On the boolean connectivity problem for horn relations. Discrete Applied Mathematics\u00a0158(18), 2024\u20132030 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"25_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0021-9800(69)80057-8","volume":"7","author":"L.S. Melnikov","year":"1969","unstructured":"Melnikov, L.S., Vizing, V.G.: New proof of brooks\u2019 theorem. Journal of Combinatorial Theory\u00a07(4), 289\u2013290 (1969)","journal-title":"Journal of Combinatorial Theory"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V.: Vertex cover reconfiguration and beyond. arXiv, 1402.4926 (2014)","DOI":"10.1007\/978-3-319-13075-0_36"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-319-03898-8_24","volume-title":"Parameterized and Exact Computation","author":"A.E. Mouawad","year":"2013","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the parameterized complexity of reconfiguration problems. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol.\u00a08246, pp. 281\u2013294. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:50:47Z","timestamp":1676886647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}