V. Bafna, P. Berman, and T. Fujito, A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem, SIAM Journal on Discrete Mathematics, vol.12, issue.3, pp.289-297, 1999.
DOI : 10.1137/S0895480196305124

D. [. Becker and . Geiger, Approximation Algorithms for the Loop Cutset Problem, Proc. of the 10th Conference on Uncertainty in Artificial Intelligence, pp.60-68, 1994.
DOI : 10.1016/B978-1-55860-332-5.50013-4

C. [. Caragiannis, P. Kaklamanis, and . Kanellopoulos, New bounds on the size of the minimum feedback vertex set in meshes and butterflies, Information Processing Letters, vol.83, issue.5, pp.275-280, 2002.
DOI : 10.1016/S0020-0190(02)00266-1

P. [. Eggleton, D. K. Erdös, and . Skilton, Colouring the real line, Journal of Combinatorial Theory, Series B, vol.39, issue.1, pp.86-100, 1985.
DOI : 10.1016/0095-8956(85)90039-5

P. [. Eggleton, D. K. Erd?, and . Skilton, Colouring prime distance graphs, Graphs and Combinatorics, vol.58, issue.1, pp.17-32, 1990.
DOI : 10.1007/BF01787476

E. [. Fertin, A. Godard, and . Raspaud, Minimum feedback vertex set and acyclic coloring, Information Processing Letters, vol.84, issue.3, pp.131-139, 2002.
DOI : 10.1016/S0020-0190(02)00265-X
URL : https://hal.archives-ouvertes.fr/hal-00307785

F. [. Focardi, D. Luccio, and . Peleg, Feedback vertex set in hypercubes, Information Processing Letters, vol.76, issue.1-2, pp.1-5, 2000.
DOI : 10.1016/S0020-0190(00)00127-7

P. [. Festa, M. G. Pardalos, and . Resende, Feedback set problem, Handbook of Combinatorial Optimization, pp.209-258, 1999.

D. [. Garey and . Johnson, Computers and intractability, 1979.

B. Effantin and H. Kheddouci, The b-chromatic number of some power graphs, Discrete Mathematics and Theoretical Computer Science, vol.6, issue.1, pp.45-54, 2003.

]. F. Luc98 and . Luccio, Almost exact minimum feedback vertex set in meshes and butterflies, Inform. Process. Lett, vol.66, issue.2, pp.59-64, 1998.

F. L. Luccio, Minimum Feedback Vertex Set in Pyramid and Mesh of Trees Networks, Proc. of the 10th Colloquium on Structural Information and Communication Complexity (SIROCCO'03), 2003.

D. A. Pike, Decycling Hypercubes, Graphs and Combinatorics, vol.19, issue.4, pp.547-550, 2003.
DOI : 10.1007/s00373-003-0529-9

Y. [. Pike and . Zou, Decycling Cartesian Products of Two Cycles, SIAM Journal on Discrete Mathematics, vol.19, issue.3, pp.651-663, 2005.
DOI : 10.1137/S089548010444016X

]. O. Tog00 and . Togni, Placement de convertisseurs de longueur d'onde dans les réseaux optiques, Proc. of2ì emes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (Algotel2000), pp.35-40, 2000.

M. Voigt, Colouring of distance graphs, Ars Combin, vol.52, pp.3-12, 1999.