{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:06:25Z","timestamp":1767139585531,"version":"build-2238731810"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00373-023-02644-w","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T10:53:11Z","timestamp":1684147991000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Reconfiguration Graphs of Independent Sets Under Token Sliding"],"prefix":"10.1007","volume":"39","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8635-8462","authenticated-orcid":false,"given":"Duc A.","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,15]]},"reference":[{"issue":"1","key":"2644_CR1","first-page":"37","volume":"16","author":"Y Alavi","year":"1991","unstructured":"Alavi, Y., Behzad, M., Erd\u0151s, P., Lick, D.R.: Double vertex graphs. J. Combin. Inf. Syst. Sci. 16(1), 37\u201350 (1991)","journal-title":"J. Combin. Inf. Syst. Sci."},{"key":"2644_CR2","doi-asserted-by":"crossref","unstructured":"Avis, D., Hoang, D.A.: A note on acyclic token sliding reconfiguration graphs of independent sets. arXiv:2301.00317 (2023)","DOI":"10.1007\/s00373-023-02644-w"},{"key":"2644_CR3","doi-asserted-by":"publisher","unstructured":"Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.Z., Hwang, F.K.M. (eds.) Computing in Euclidean Geometry, no.\u00a01 in Lecture Notes Series on Computing, pp. 23\u201390. World Scientific (1992). https:\/\/doi.org\/10.1142\/9789814355858_0002","DOI":"10.1142\/9789814355858_0002"},{"key":"2644_CR4","doi-asserted-by":"publisher","unstructured":"Bonamy, M., Bousquet, N.: Token sliding on chordal graphs. In: Proceedings of WG 2017, LNCS, vol. 10520, pp. 127\u2013139. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_10","DOI":"10.1007\/978-3-319-68705-6_10"},{"key":"2644_CR5","doi-asserted-by":"publisher","unstructured":"Bonsma, P.S., Kami\u0144ski, M., Wrochna, M.: Reconfiguring independent sets in claw-free graphs. In: Proceedings of SWAT 2014, LNCS, vol. 8503, pp. 86\u201397. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_8","DOI":"10.1007\/978-3-319-08404-6_8"},{"key":"2644_CR6","doi-asserted-by":"publisher","unstructured":"Bria\u0144ski, M., Felsner, S., Hodor, J., Micek, P.: Reconfiguring independent sets on interval graphs. In: Bonchi, F., Puglisi, S.J. (eds.) Proceedings of MFCS 2021, LIPIcs, vol. 202, pp. 23:1\u201323:14 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2021.23","DOI":"10.4230\/LIPIcs.MFCS.2021.23"},{"key":"2644_CR7","doi-asserted-by":"publisher","unstructured":"Collins, K.L., Trenk, A.N.: Split graphs. In: Beineke, L.W., Golumbic, M.C., Wilson, R.J. (eds.) Topics in Algorithmic Graph Theory, Encyclopedia of Mathematics and its Applications, pp. 189\u2013206. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108592376.012","DOI":"10.1017\/9781108592376.012"},{"key":"2644_CR8","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2015.07.037","volume":"600","author":"ED Demaine","year":"2015","unstructured":"Demaine, E.D., Demaine, M.L., Fox-Epstein, E., Hoang, D.A., Ito, T., Ono, H., Otachi, Y., Uehara, R., Yamada, T.: Linear-time algorithm for sliding tokens on trees. Theor. Comput. Sci. 600, 132\u2013142 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.07.037","journal-title":"Theor. Comput. Sci."},{"key":"2644_CR9","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph theory. In: Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"2644_CR10","doi-asserted-by":"publisher","unstructured":"Fox-Epstein, E., Hoang, D.A., Otachi, Y., Uehara, R.: Sliding token on bipartite permutation graphs. In: Proceedings of ISAAC 2015, LNCS, vol. 9472, pp. 237\u2013247. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_21","DOI":"10.1007\/978-3-662-48971-0_21"},{"issue":"39","key":"2644_CR11","doi-asserted-by":"publisher","first-page":"5205","DOI":"10.1016\/j.tcs.2011.05.021","volume":"412","author":"M Kami\u0144ski","year":"2011","unstructured":"Kami\u0144ski, M., Medvedev, P., Milani\u010d, M.: Shortest paths between shortest paths. Theor. Comput. Sci. 412(39), 5205\u20135210 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.021","journal-title":"Theor. Comput. Sci."},{"key":"2644_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.03.004","volume":"439","author":"M Kami\u0144ski","year":"2012","unstructured":"Kami\u0144ski, M., Medvedev, P., Milani\u010d, M.: Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439, 9\u201315 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.03.004","journal-title":"Theor. Comput. Sci."},{"key":"2644_CR13","doi-asserted-by":"publisher","unstructured":"Lawson, C.L.: Software for C1 surface interpolation. In: Mathematical Software, pp. 161\u2013194. Elsevier, Amsterdam (1977). https:\/\/doi.org\/10.1016\/B978-0-12-587260-7.50011-X","DOI":"10.1016\/B978-0-12-587260-7.50011-X"},{"issue":"3","key":"2644_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00373-011-1055-9","volume":"28","author":"RF Monroy","year":"2012","unstructured":"Monroy, R.F., Flores-Pe\u00f1aloza, D., Huemer, C., Hurtado, F., Urrutia, J., Wood, D.R.: Token graphs. Graphs Combin. 28(3), 365\u2013380 (2012). https:\/\/doi.org\/10.1007\/s00373-011-1055-9","journal-title":"Graphs Combin."},{"key":"2644_CR15","doi-asserted-by":"publisher","unstructured":"Mynhardt, C., Nasserasr, S.: Reconfiguration of colourings and dominating sets in graphs. In: Chung, F., Graham, R., Hoffman, F., Mullin, R.C., Hogben, L., West, D.B. (eds.) 50 years of Combinatorics, Graph Theory, and Computing, 1st edn., pp. 171\u2013191. CRC Press, Hoboken (2019). https:\/\/doi.org\/10.1201\/9780429280092-10","DOI":"10.1201\/9780429280092-10"},{"issue":"4","key":"2644_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.3390\/a11040052","volume":"11","author":"N Nishimura","year":"2018","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/a11040052","journal-title":"Algorithms"},{"key":"2644_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 1st edn. Springer, Berlin (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","edition":"1"},{"key":"2644_CR18","doi-asserted-by":"publisher","unstructured":"van\u00a0den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol. 409, pp. 127\u2013160. Cambridge University Press, Cambridge (2013). https:\/\/doi.org\/10.1017\/cbo9781139506748.005","DOI":"10.1017\/cbo9781139506748.005"}],"updated-by":[{"DOI":"10.1007\/s00373-023-02684-2","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T00:00:00Z","timestamp":1690588800000}}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02644-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02644-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02644-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T02:04:53Z","timestamp":1690596293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02644-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2644"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02644-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"7 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2023","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00373-023-02684-2","URL":"https:\/\/doi.org\/10.1007\/s00373-023-02684-2","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing of interests"}}],"article-number":"59"}}