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

M. Chlebík, C. , and J. , Approximation Hardness of Dominating Set Problems, Algorithms ? ESA, pp.192-203, 2004.
DOI : 10.1007/978-3-540-30140-0_19

V. Chvatal, A Greedy Heuristic for the Set-Covering Problem, Mathematics of Operations Research, vol.4, issue.3, pp.233-235, 1979.
DOI : 10.1287/moor.4.3.233

A. Cornet and C. Laforest, Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts, Discrete Mathematics & Theoretical Computer Science, vol.19, issue.3, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01455072

A. Cornet and C. Laforest, Domination problems with no conflicts, Discrete Applied Mathematics, vol.244, pp.327-338, 2018.
DOI : 10.1016/j.dam.2018.03.018

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

R. G. Diestel and . Theory, of Graduate texts in mathematics, 2012.

M. R. Garey, J. , D. S. Computers, and I. W. Freeman, , 1979.

M. M. Kanté, C. Laforest, and B. 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, pp.257-267, 2013.
DOI : 10.1007/978-3-642-35843-2_23

M. M. Kanté, C. Laforest, and B. Momège, Trees in Graphs with Conflict Edges or Forbidden Transitions, TAMC 2013, pp.343-354, 2013.
DOI : 10.1007/978-3-642-38236-9_31

M. M. Kanté, F. Z. Moataz, B. Momège, N. , and N. , Finding Paths in Grids with Forbidden Transitions, WG 2015, pp.154-168, 2015.
DOI : 10.1016/j.ejor.2004.01.032

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

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

C. Laforest and B. Momège, Some Hamiltonian Properties of One-Conflict Graphs, Lecture Notes in Computer Science, vol.8986, pp.262-273, 2014.
DOI : 10.1007/978-3-319-19315-1_23
URL : https://hal.archives-ouvertes.fr/hal-01977822

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

R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.475-484, 1997.
DOI : 10.1145/258533.258641

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