{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:50Z","timestamp":1770994130166,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031754081","type":"print"},{"value":"9783031754098","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_23","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:38Z","timestamp":1737497438000},"page":"327-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Connectivity of\u00a0the\u00a0Flip Graph of\u00a0Plane Spanning Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3786-916X","authenticated-orcid":false,"given":"Linda","family":"Kleist","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9635-5890","authenticated-orcid":false,"given":"Peter","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0846-5163","authenticated-orcid":false,"given":"Christian","family":"Rieck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"issue":"1\u20132","key":"23_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(01)00042-6","volume":"21","author":"O Aichholzer","year":"2002","unstructured":"Aichholzer, O., Aurenhammer, F., Hurtado, F.: Sequences of spanning trees and a fixed tree theorem. Comput. Geom. Theory Appl. 21(1\u20132), 3\u201320 (2002). https:\/\/doi.org\/10.1016\/S0925-7721(01)00042-6","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., et al.: Reconfiguration of non-crossing spanning trees (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.03879","DOI":"10.48550\/arXiv.2206.03879"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Aichholzer, O., Knorr, K., Mulzer, W., Obenaus, J., Paul, R., Vogtenhuber, B.: Flipping plane spanning paths. In: International Conference and Workshops on Algorithms and Computation (WALCOM), pp. 49\u201360 (2023). https:\/\/doi.org\/10.1007\/978-3-031-27051-2_5","DOI":"10.1007\/978-3-031-27051-2_5"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ipl.2007.05.009","volume":"104","author":"SG Akl","year":"2007","unstructured":"Akl, S.G., Islam, M.K., Meijer, H.: On planar path transformation. Inf. Process. Lett. 104(2), 59\u201364 (2007). https:\/\/doi.org\/10.1016\/j.ipl.2007.05.009","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"23_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discret. Appl. Math. 65(1\u20133), 21\u201346 (1996). https:\/\/doi.org\/10.1016\/0166-218X(95)00026-N","journal-title":"Discret. Appl. Math."},{"key":"23_CR6","doi-asserted-by":"publisher","unstructured":"Bjerkevik, H.B., Kleist, L., Ueckerdt, T., Vogtenhuber, B.: Non-crossing spanning trees. In: Proceedings of the Symposium on Discrete Algorithms (SODA 2025). https:\/\/doi.org\/10.48550\/arXiv.2410.23809","DOI":"10.48550\/arXiv.2410.23809"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.comgeo.2008.04.001","volume":"42","author":"P Bose","year":"2009","unstructured":"Bose, P., Hurtado, F.: Flips in planar graphs. Comput. Geom. Theory Appl. 42(1), 60\u201380 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2008.04.001","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Bousquet, N., Gledel, V., Narboni, J., Pierron, T.: A note on the flip distance between non-crossing spanning trees. Comput. Geom. Topol. 2(1), 8:1\u20138:7 (2023). https:\/\/doi.org\/10.57717\/cgt.v2i1.36","DOI":"10.57717\/cgt.v2i1.36"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Bousquet, N., de\u00a0Meyer, L., Pierron, T., Wesolek, A.: Reconfiguration of plane trees in convex geometric graphs. In: International Symposium on Computational Geometry (SoCG), pp. 22:1\u201322:17 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2024.22","DOI":"10.4230\/LIPIcs.SoCG.2024.22"},{"issue":"8","key":"23_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ipl.2008.12.017","volume":"109","author":"JM Chang","year":"2009","unstructured":"Chang, J.M., Wu, R.Y.: On the diameter of geometric path graphs of points in convex position. Inf. Process. Lett. 109(8), 409\u2013413 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2008.12.017","journal-title":"Inf. Process. Lett."},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Eppstein, D.: Happy endings for flip graphs. J. Comput. Geom. 1(1), 3\u201328 (2010). https:\/\/doi.org\/10.20382\/JOCG.V1I1A2","DOI":"10.20382\/JOCG.V1I1A2"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/18M1216456","volume":"34","author":"S Felsner","year":"2020","unstructured":"Felsner, S., Kleist, L., M\u00fctze, T., Sering, L.: Rainbow cycles in flip graphs. SIAM J. Discret. Math. 34(1), 1\u201339 (2020). https:\/\/doi.org\/10.1137\/18M1216456","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/S0304-3975(01)00409-1","volume":"289","author":"MC Hernando","year":"2002","unstructured":"Hernando, M.C., Houle, M.E., Hurtado, F.: On local transformation of polygons with visibility properties. Theor. Comput. Sci. 289(2), 919\u2013937 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00409-1","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0166-218X(99)00006-2","volume":"93","author":"MC Hernando","year":"1999","unstructured":"Hernando, M.C., Hurtado, F., M\u00e1rquez, A., Mora, M., Noy, M.: Geometric tree graphs of points in convex position. Discret. Appl. Math. 93(1), 51\u201366 (1999). https:\/\/doi.org\/10.1016\/S0166-218X(99)00006-2","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/S003730200038","volume":"18","author":"MC Hernando","year":"2002","unstructured":"Hernando, M.C., Hurtado, F., Noy, M.: Graphs of non-crossing perfect matchings. Graphs Comb. 18(3), 517\u2013532 (2002). https:\/\/doi.org\/10.1007\/S003730200038","journal-title":"Graphs Comb."},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/S00373-005-0615-2","volume":"21","author":"ME Houle","year":"2005","unstructured":"Houle, M.E., Hurtado, F., Noy, M., Rivera-Campo, E.: Graphs of triangulations and perfect matchings. Graphs Comb. 21(3), 325\u2013331 (2005). https:\/\/doi.org\/10.1007\/S00373-005-0615-2","journal-title":"Graphs Comb."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/PL00009464","volume":"22","author":"F Hurtado","year":"1999","unstructured":"Hurtado, F., Noy, M., Urrutia, J.: Flipping edges in triangulations. Discret. Comput. Geom. 22(3), 333\u2013346 (1999). https:\/\/doi.org\/10.1007\/PL00009464","journal-title":"Discret. Comput. Geom."},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Kleist, L., Kramer, P., Rieck, C.: On the connectivity of the flip graph of plane spanning paths (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.03912","DOI":"10.48550\/arXiv.2407.03912"},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0012-365X(72)90093-3","volume":"3","author":"CL Lawson","year":"1972","unstructured":"Lawson, C.L.: Transforming triangulations. Discret. Math. 3(4), 365\u2013372 (1972). https:\/\/doi.org\/10.1016\/0012-365X(72)90093-3","journal-title":"Discret. Math."},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/J.COMGEO.2014.11.001","volume":"49","author":"A Lubiw","year":"2015","unstructured":"Lubiw, A., Pathak, V.: Flip distance between two triangulations of a point set is NP-complete. Comput. Geom. Theory Appl. 49, 17\u201323 (2015). https:\/\/doi.org\/10.1016\/J.COMGEO.2014.11.001","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/J.DAM.2020.10.018","volume":"289","author":"M Milich","year":"2021","unstructured":"Milich, M., M\u00fctze, T., Pergel, M.: On flips in planar matchings. Discret. Appl. Math. 289, 427\u2013445 (2021). https:\/\/doi.org\/10.1016\/J.DAM.2020.10.018","journal-title":"Discret. Appl. Math."},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Monroy, R.F., Flores-Pe\u00f1aloza, D., Huemer, C., Hurtado, F., Wood, D.R., Urrutia, J.: On the chromatic number of some flip graphs. Discret. Math. Theor. Comput. Sci. 11(2), 47\u201356 (2009). https:\/\/doi.org\/10.46298\/DMTCS.460","DOI":"10.46298\/DMTCS.460"},{"issue":"8","key":"23_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/J.DISC.2020.111929","volume":"343","author":"TL Nichols","year":"2020","unstructured":"Nichols, T.L., Pilz, A., T\u00f3th, C.D., Zehmakan, A.N.: Transition operations over plane trees. Discret. Math. 343(8), 111929 (2020). https:\/\/doi.org\/10.1016\/J.DISC.2020.111929","journal-title":"Discret. Math."},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Nishimura, N.: Introduction to reconfiguration. Algorithms 11(4), 52 (2018). https:\/\/doi.org\/10.3390\/A11040052","DOI":"10.3390\/A11040052"},{"issue":"2","key":"23_CR25","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0925-7721(00)00026-2","volume":"18","author":"E Rivera-Campo","year":"2001","unstructured":"Rivera-Campo, E., Urrutia-Galicia, V.: Hamilton cycles in the path graph of a set of points in convex position. Comput. Geom. Theory Appl. 18(2), 65\u201372 (2001). https:\/\/doi.org\/10.1016\/S0925-7721(00)00026-2","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"23_CR26","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/S00454-022-00436-2","volume":"68","author":"U Wagner","year":"2022","unstructured":"Wagner, U., Welzl, E.: Connectivity of triangulation flip graphs in the plane. Discret. Comput. Geom. 68(4), 1227\u20131284 (2022). https:\/\/doi.org\/10.1007\/S00454-022-00436-2","journal-title":"Discret. Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:41Z","timestamp":1737497441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}