A feedback vertex set of a graph is a set of vertices whose removal results an acyclic graph. This paper shows that for every planar graph the minimum cardinality of a feedback vertex set is at most three times the maximum number of vertex disjoint cycles in the graph.
References
V. Bafna, P. Berman and T. Fujito, A 2-approximation algorithm for the undirected feedback vertex set problem, SIAM J. Discrete Math., 12 (1999), 289-297. MR1710236 0932.68054 10.1137/S0895480196305124 V. Bafna, P. Berman and T. Fujito, A 2-approximation algorithm for the undirected feedback vertex set problem, SIAM J. Discrete Math., 12 (1999), 289-297. MR1710236 0932.68054 10.1137/S0895480196305124
A. Becker and D. Geiger, Optimization of pearl's method of conditioning and greedy-like approximation algorithms for the feedback vertex set problem, Artif. Intell., 83 (1996), 167-188. A. Becker and D. Geiger, Optimization of pearl's method of conditioning and greedy-like approximation algorithms for the feedback vertex set problem, Artif. Intell., 83 (1996), 167-188.
F. A. Chudak, M. X. Goemans, D. S. Hochbaum and D. P. Williamson, A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett., 22 (1998), 111-118. MR1654290 0920.90137 10.1016/S0167-6377(98)00021-2 F. A. Chudak, M. X. Goemans, D. S. Hochbaum and D. P. Williamson, A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett., 22 (1998), 111-118. MR1654290 0920.90137 10.1016/S0167-6377(98)00021-2
I. Dinur and S. Safra, On the hardness of approximating minimum vertex cover, Annals of Mathematics, 162 (2005), 439-485. 1084.68051 I. Dinur and S. Safra, On the hardness of approximating minimum vertex cover, Annals of Mathematics, 162 (2005), 439-485. 1084.68051
P. Erd$\ddot{o}$s and L. P$\acute{o}$sa, On independent circuits contained in a graph, Canad. J. Math., 17 (1964), 347-352. MR175810 0129.39904 10.4153/CJM-1965-035-8 P. Erd$\ddot{o}$s and L. P$\acute{o}$sa, On independent circuits contained in a graph, Canad. J. Math., 17 (1964), 347-352. MR175810 0129.39904 10.4153/CJM-1965-035-8
P. Festa, P. M. Pardalos and M. G. C. Resende, Feedback set problems, in: Handbook of Combinatorial Optimization, Vol. A, Dordrecht, Kluwer Acad. Publ., 1999, pp. 209-258. 1253.90193 P. Festa, P. M. Pardalos and M. G. C. Resende, Feedback set problems, in: Handbook of Combinatorial Optimization, Vol. A, Dordrecht, Kluwer Acad. Publ., 1999, pp. 209-258. 1253.90193
F. V. Fomin, S. Gaspers, A. V. Pyatkin and I. Razgon, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Algorithmica, 52 (2008), 293-307 1170.68029 10.1007/s00453-007-9152-0 F. V. Fomin, S. Gaspers, A. V. Pyatkin and I. Razgon, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Algorithmica, 52 (2008), 293-307 1170.68029 10.1007/s00453-007-9152-0
F. V. Fomin and Y. Villanger, Finding induced subgraphs via minimal triangulations, in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, (STACS 2010), Vol. 5, 2010, pp. 383-394. 1230.68108 F. V. Fomin and Y. Villanger, Finding induced subgraphs via minimal triangulations, in Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, (STACS 2010), Vol. 5, 2010, pp. 383-394. 1230.68108
M. X. Goemans and D. P. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Combinatorica, 18 (1998), 37-59. 0928.90094 10.1007/PL00009810 M. X. Goemans and D. P. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, Combinatorica, 18 (1998), 37-59. 0928.90094 10.1007/PL00009810
T. Kloks, C.-M. Lee and J. Liu, New algorithms for $k$-face cover, $k$-feedback vertex set, and $k$-disjoint cycles on plane and planar graphs, in: Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Vol. 2573, Springer-Verlag, 2002, pp. 282-295. 1022.68100 T. Kloks, C.-M. Lee and J. Liu, New algorithms for $k$-face cover, $k$-feedback vertex set, and $k$-disjoint cycles on plane and planar graphs, in: Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Vol. 2573, Springer-Verlag, 2002, pp. 282-295. 1022.68100
A. Koutsonas and D. M. Thilikos, Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms, in Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Vol. 5344, Springer Verlag, 2008, pp. 264-274. 1202.68284 A. Koutsonas and D. M. Thilikos, Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms, in Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008), Vol. 5344, Springer Verlag, 2008, pp. 264-274. 1202.68284
N. Robertson, P. Sanders, P. Seymour and R. Thomas, The four colour theorem, J. Combin. Theory Ser. B., 40 (1997), 2-44. 0883.05056 10.1006/jctb.1997.1750 N. Robertson, P. Sanders, P. Seymour and R. Thomas, The four colour theorem, J. Combin. Theory Ser. B., 40 (1997), 2-44. 0883.05056 10.1006/jctb.1997.1750
I. Razgon, Computing minimum directed feedback vertex set in $O^*(1.9977^n)$, in: Proceedings of the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, pp. 70-81. I. Razgon, Computing minimum directed feedback vertex set in $O^*(1.9977^n)$, in: Proceedings of the 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, pp. 70-81.
A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, John Wiley & Sons, 8th ed., 2008. 0883.68037 A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, John Wiley & Sons, 8th ed., 2008. 0883.68037
H. J. Voss, Some properties of graphs containing $k$ independent circuits, Proc. Colloq. Tihany, Academic Press, New York, 1968, pp. 321-334. 0157.31303 H. J. Voss, Some properties of graphs containing $k$ independent circuits, Proc. Colloq. Tihany, Academic Press, New York, 1968, pp. 321-334. 0157.31303
