Abertson, Michael O.

Large induced forest in a planar graph. ★★

Conjecture Every planar graph on $n$ verices has an induced forest with at least $n/2$ vertices.

Keywords:

Posted by fhavet
updated March 4th, 2013