B. Aspvall, M. F. Plass, and R. E. 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. Darmann, U. Pferschy, J. Schauer, and G. J. Woeginger, Paths, trees and matchings under disjunctive constraints, Discrete Applied Mathematics, vol.159, issue.16, pp.1726-1735, 2011.
DOI : 10.1016/j.dam.2010.12.016

F. Delbot, C. Laforest, and R. Phan, New Approximation Algorithms for the Vertex Cover Problem, IWOCA, pp.438-442, 2013.
DOI : 10.1007/978-3-642-45278-9_39
URL : https://hal.archives-ouvertes.fr/hal-01215211

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in the Mathematical Sciences). W. H. Freeman & Co Ltd, 1979.

D. Gusfield and L. Pitt, A bounded approximation for the minimum cost 2-sat problem, Algorithmica, vol.15, issue.6, pp.103-117, 1992.
DOI : 10.1007/BF01758838

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.38-49, 1973.
DOI : 10.1145/800125.804034
URL : http://doi.org/10.1016/s0022-0000(74)80044-9

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
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 (Theory and Applications of Models of Computation), pp.343-354, 2013.
DOI : 10.1007/978-3-642-38236-9_31

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

M. R. Krom, The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.24, issue.1-2, pp.15-20, 1967.
DOI : 10.1002/malq.19670130104

C. Laforest and B. Momège, Some Hamiltonian Properties of One-Conflict Graphs, Combinatorial Algorithms -25th International Workshop, 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: Theory and Practice of Computer Science -41st International Conference on Current Trends in Theory and Practice of Computer Science. Proceedings, pp.327-338, 2015.
DOI : 10.1007/978-3-662-46078-8_27

G. Robins and A. Zelikovsky, Improved steiner tree approximation in graphs, SODA, pp.770-779, 2000.

C. Savage, Depth-first search and the vertex cover problem, Information Processing Letters, vol.14, issue.5, pp.233-235, 1982.
DOI : 10.1016/0020-0190(82)90022-9

S. Szeider, Finding paths in graphs avoiding forbidden transitions, Discrete Applied Mathematics, vol.126, issue.2-3, pp.261-273, 2003.
DOI : 10.1016/S0166-218X(02)00251-2

V. V. Vazirani, Approximation algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7