Minimum feedback vertex set and acyclic coloring

Abstract : In the feedback vertex set problem, the aim is to minimize, in a connected graph G =(V,E), the cardinality of the set overline(V) (G) \subseteq V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in G). Then, using results from acyclic coloring, as well as other techniques, we are able to derive new lower and upper bounds on the cardinality of a minimum feedback vertex set in large families of graphs, such as graphs of maximum degree 3, of maximum degree 4, planar graphs, outerplanar graphs, 1-planar graphs, k-trees, etc. Some of these bounds are tight (outerplanar graphs, k-trees), all the others differ by a multiplicative constant never exceeding 2.
Liste complète des métadonnées
Contributor : Guillaume Fertin <>
Submitted on : Tuesday, September 15, 2009 - 10:18:56 AM
Last modification on : Thursday, April 5, 2018 - 10:36:48 AM
Document(s) archivé(s) le : Saturday, November 26, 2016 - 12:45:56 AM


Files produced by the author(s)


  • HAL Id : hal-00307785, version 1
  • ARXIV : 0909.2607


Guillaume Fertin, Emmanuel Godard, André Raspaud. Minimum feedback vertex set and acyclic coloring. Information Processing Letters, Elsevier, 2002, 84 (3), pp.131-139. ⟨hal-00307785⟩



Record views


Files downloads