Small feedback vertex sets in planar digraphs

Abstract

Let G be a directed planar graph on n vertices, with no directed cycle of length less than g 4. We prove that G contains a set X of vertices such that G-X has no directed cycle, and |X| 5n-59 if g=4, |X| 2n-54 if g=5, and |X| 2n-6g if g 6. This improves recent results of Golowich and Rolnick.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…