Abstract
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.
Citation
Hong-Bin Chen. Hung-Lin Fu. Chie-Huai Shih. "FEEDBACK VERTEX SET ON PLANAR GRAPHS." Taiwanese J. Math. 16 (6) 2077 - 2082, 2012. https://doi.org/10.11650/twjm/1500406840
Information
