O. Aichholzer, W. Mulzer, and A. Pilz, Flip distance between triangulations of a simple polygon is NP-complete, Discrete & Computational Geometry, vol.54, issue.2, pp.368-389, 2015.

S. Bereg and H. Ito, Transforming Graphs with the Same Graphic Sequence, Journal of Information Processing, vol.25, pp.627-633, 2017.

M. Bonamy and N. Bousquet, Reconfiguring independent sets in cographs, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01431388

P. Bonsma, Independent set reconfiguration in cographs and their generalizations, Journal of Graph Theory, vol.83, issue.2, pp.164-195, 2016.

P. Bonsma, M. Kami?ski, and M. Wrochna, Reconfiguring Independent Sets in Claw-Free Graphs, Proceedings of the 14th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2014 ), vol.8503, pp.86-97, 2014.

N. Bousquet, A. Mary, and A. Parreau, Token Jumping in Minor-Closed Classes, Proceedings of the 21st International Symposium on Fundamentals of Computation Theory, vol.10472, pp.136-149, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01634505

E. D. Demaine, M. L. Demaine, E. Fox-epstein, D. A. Hoang, T. Ito et al., Linear-time algorithm for sliding tokens on trees, Theoretical Computer Science, vol.600, pp.132-142, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02124863

P. Diaconis, R. Graham, and S. P. Holmes, Statistical problems involving permutations with restricted positions, Lecture Notes-Monograph Series, vol.36, pp.195-222, 2001.

, Graph Theory, vol.173, 2005.

F. Feodor and . Dragan, On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract), Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, vol.1335, pp.184-198, 1997.

F. Feodor and . Dragan, Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs, Discrete Applied Mathematics, vol.99, issue.1-3, pp.427-442, 2000.

M. Dyer and H. Müller, Counting perfect matchings and the switch chain, 2017.

M. E. Dyer, M. Jerrum, and H. Müller, On the Switch Markov Chain for Perfect Matchings, Journal of the ACM, vol.64, issue.2, 2017.

D. Gusfield and R. W. Irving, The Stable Marriage Problem: Structure and Algorithms, 1989.

S. L. Hakimi, On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II, Uniqueness. Journal of the Society for Industrial and Applied Mathematics, vol.11, issue.1, pp.135-147, 1963.

A. Robert, E. D. Hearn, and . Demaine, PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation, Theoretical Computer Science, vol.343, issue.1-2, p.14, 2005.

, The Perfect Matching Reconfiguration Problem

J. Van-den and . Heuvel, The complexity of change, Surveys in Combinatorics 2013, pp.127-160, 2013.

M. E. Houle, F. Hurtado, M. Noy, and E. Rivera-campo, Graphs of triangulations and perfect matchings, Graphs and Combinatorics, vol.21, issue.3, pp.325-331, 2005.

W. Hsu, A Simple Test for Interval Graphs, Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, vol.657, pp.11-16, 1992.

F. Hurtado, M. Noy, and J. Urrutia, Flipping edges in triangulations, Discrete & Computational Geometry, vol.22, issue.3, pp.333-346, 1999.

T. Ito, E. D. Demaine, J. A. Nicholas, C. H. Harvey, M. Papadimitriou et al., On the complexity of reconfiguration problems, Theoretical Computer Science, vol.412, pp.1054-1065, 2011.

T. Ito, M. Kami?ski, H. Ono, A. Suzuki, R. Uehara et al., On the Parameterized Complexity for Token Jumping on Graphs, Proceedings of the 11th Annual Conference on Theory and Applications of Models of Computation, vol.8402, pp.341-351, 2014.

M. Kami?ski, P. Medvedev, and M. Milani?, Complexity of independent set reconfigurability problems, Theoretical Computer Science, vol.439, pp.9-15, 2012.

C. L. Lawson, Software for C1 surface interpolation, Mathematical software, pp.161-194, 1977.

A. Lubiw and V. Pathak, Flip distance between two triangulations of a point set is NP-complete, Computational Geometry, vol.49, pp.17-23, 2015.

H. Mizuta, T. Ito, and X. Zhou, Reconfiguration of Steiner Trees in an Unweighted Graph, IEICE Transactions on Fundamentals of Electronics, issue.7, pp.1532-1540, 2017.

N. Nishimura, Introduction to Reconfiguration, Algorithms, vol.11, issue.4, p.52, 2018.

C. Nicolau, C. Saldanha, M. A. Tomei, D. Casarin, and . Romualdo, Spaces of domino tilings, Discrete & Computational Geometry, vol.14, issue.2, pp.207-233, 1995.

J. Walter and . Savitch, Relationships Between Nondeterministic and Deterministic Tape Complexities, Journal of Computer and System Sciences, vol.4, pp.177-192, 1970.

J. K. Senior, Partitions and Their Representative Graphs, American Journal of Mathematics, vol.73, issue.3, pp.663-689, 1951.

D. Stefankovic, E. Vigoda, and J. Wilmes, On Counting Perfect Matchings in General Graphs, Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN 2018 ), vol.10807, pp.873-885, 2018.

T. G. Will, Switching Distance Between Graphs with the Same Degrees, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.298-306, 1999.

M. Wrochna, Reconfiguration in bounded bandwidth and tree-depth, Journal of Computer and System Sciences, vol.93, pp.1-10, 2018.

C. Tom and . Van-der-zanden, Parameterized Complexity of Graph Constraint Logic, Proceedings of the 10th International Symposium on Parameterized and Exact Computation, vol.43, pp.282-293, 2015.