G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation: Combinatorial optimization problems and their approximability properties, 2012.
DOI : 10.1007/978-3-642-58412-1

B. Aspvall, F. Michael, R. E. Plass, and . Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.
DOI : 10.1016/0020-0190(79)90002-4

A. Cornet and C. Laforest, Domination problems with conflicts

F. Delbot, C. Laforest, and R. Phan, Hardness Results and Approximation Algorithms for Discrete Optimization Problems with Conditional and Unconditional Forbidden Vertices, Research report, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01257820

N. Harold, . Gabow, N. Shachindra, L. J. Maheshwari, and . Osterweil, On two problems in the generation of program test paths, IEEE Transactions on Software Engineering, issue.3, pp.227-231, 1976.

C. Mamadou-moustapha-kanté, B. Laforest, and . Momège, An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions, SOFSEM 2013, volume LNCS 7741, pp.257-267, 2013.

C. Mamadou-moustapha-kanté, B. Laforest, and . Momège, Trees in graphs with conflict edges or forbidden transitions, TAMC 2013, pp.343-354, 2013.

F. Z. Mamadou-moustapha-kanté, B. Moataz, N. Momège, and . Nisse, Finding paths in grids with forbidden transitions, Graph-Theoretic Concepts in Computer Science -41st International Workshop, WG 2015, volume LNCS 9224, pp.154-168, 2015.

J. Ková?, Complexity of the path avoiding forbidden pairs problem revisited, Discrete Applied Mathematics, vol.161, issue.10-11, pp.1506-1512, 2013.
DOI : 10.1016/j.dam.2012.12.022

P. Kolman and O. Pangrác, On the complexity of paths avoiding forbidden pairs, Discrete Applied Mathematics, vol.157, issue.13, pp.2871-2876, 2009.
DOI : 10.1016/j.dam.2009.03.018

C. Laforest and B. Momège, Some Hamiltonian Properties of One-Conflict Graphs, IWOCA 2014, volume LNCS 8986, pp.262-273, 2014.
DOI : 10.1007/978-3-319-19315-1_23

C. Laforest and B. Momège, Nash-Williams-type and Chv??tal-type Conditions in One-Conflict Graphs, SOFSEM 2015, pp.327-338, 2015.
DOI : 10.1007/978-3-662-46078-8_27

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984.
DOI : 10.1016/0166-218X(84)90081-7
URL : https://doi.org/10.1016/0166-218x(84)90081-7

H. Yinnone, On paths avoiding forbidden pairs of vertices in a graph, Discrete Applied Mathematics, vol.74, issue.1, pp.85-92, 1997.
DOI : 10.1016/S0166-218X(96)00017-0