Ononot — In a graph, a vertex set S is called a feedback vertex set i

Graph Theorymedium

0:00.0

In a graph, a vertex set $S$ is called a feedback vertex set if removing $S$ results in an acyclic graph (a forest). What is the minimum size of a feedback vertex set in $C_5$ ?