{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:28:35Z","timestamp":1770902915584,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17156-6_31","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:13Z","timestamp":1770899773000},"page":"416-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on\u00a0Reconfiguration Graphs of\u00a0Cliques"],"prefix":"10.1007","author":[{"given":"Nhat-Quan","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huu-An","family":"Phan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc A.","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1112\/plms\/s3-58.3.439","volume":"3","author":"HJ Bandelt","year":"1989","unstructured":"Bandelt, H.J., van de Vel, M.: Embedding topological median algebras in products of dendrons. Proc. Lond. Math. Soc. 3(3), 439\u2013453 (1989). https:\/\/doi.org\/10.1112\/plms\/s3-58.3.439","journal-title":"Proc. Lond. Math. Soc."},{"key":"31_CR2","unstructured":"Bousquet, N., Mouawad, A.E., Nishimura, N., Siebertz, S.: A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. arXiv preprint (2022). https:\/\/arxiv.org\/abs\/2204.10526"},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol.\u00a0173, 5th edn. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","DOI":"10.1007\/978-3-662-53622-3"},{"key":"31_CR4","doi-asserted-by":"publisher","unstructured":"Eroh, L., Schultz, M.: Matching graphs. J. Graph Theory 29(2), 73\u201386 (1998). https:\/\/doi.org\/10.1002\/(SICI)1097-0118(199810)29:2<73::AID-JGT3>3.0.CO;2-9","DOI":"10.1002\/(SICI)1097-0118(199810)29:2<73::AID-JGT3>3.0.CO;2-9"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/jgt.3190030108","volume":"3","author":"SL Hakimi","year":"1979","unstructured":"Hakimi, S.L., Schmeichel, E.F.: On the number of cycles of length k in a maximal planar graph. J. Graph Theory 3(1), 69\u201386 (1979). https:\/\/doi.org\/10.1002\/jgt.3190030108","journal-title":"J. Graph Theory"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.tcs.2019.09.018","volume":"806","author":"T Hanaka","year":"2020","unstructured":"Hanaka, T., et al.: Reconfiguring spanning and induced subgraphs. Theoret. Comput. Sci. 806, 553\u2013566 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.09.018","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Holton, D.A., Sheehan, J.: 8. The Johnson graphs and even graphs. In: The Petersen Graph. Australian Mathematical Society Lecture Series, vol.\u00a07, p.\u00a0300. Cambridge University Press (1993). https:\/\/doi.org\/10.1017\/CBO9780511662058.010","DOI":"10.1017\/CBO9780511662058.010"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-17142-5_19","volume-title":"Theory and Applications of Models of Computation","author":"T Ito","year":"2015","unstructured":"Ito, T., Ono, H., Otachi, Y.: Reconfiguration of cliques in a graph. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 212\u2013223. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_19"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.dam.2023.01.026","volume":"333","author":"T Ito","year":"2023","unstructured":"Ito, T., Ono, H., Otachi, Y.: Reconfiguration of cliques in a graph. Discret. Appl. Math. 333, 43\u201358 (2023). https:\/\/doi.org\/10.1016\/j.dam.2023.01.026","journal-title":"Discret. Appl. Math."},{"key":"31_CR10","unstructured":"Lam, Q.N., Phan, H.A., Hoang, D.A.: A note on reconfiguration graphs of cliques. arXiv preprint (2025). https:\/\/arxiv.org\/abs\/2506.07821"},{"issue":"3","key":"31_CR11","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":"31_CR12","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 (2019). https:\/\/doi.org\/10.1201\/9780429280092-10","DOI":"10.1201\/9780429280092-10"},{"issue":"4","key":"31_CR13","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":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-22177-9_10","volume-title":"Fundamentals of Computation Theory","author":"P Scharpfenecker","year":"2015","unstructured":"Scharpfenecker, P.: On the structure of solution-graphs for Boolean formulas. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 118\u2013130. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22177-9_10"},{"key":"31_CR15","unstructured":"Shuldiner, P., Oldford, R.W.: The clique structure of Johnson graphs. arXiv preprint (2022). https:\/\/arxiv.org\/abs\/2208.12710"},{"key":"31_CR16","doi-asserted-by":"publisher","unstructured":"van den Heuvel, J.: The complexity of change. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0409, pp. 127\u2013160. Cambridge University Press (2013). https:\/\/doi.org\/10.1017\/cbo9781139506748.005","DOI":"10.1017\/cbo9781139506748.005"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:14Z","timestamp":1770899774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}