Home » Author index

Berman, David M.


Graph Theory » Topological G.T.

Large induced forest in a planar graph. ★★

Author(s): Abertson; Berman

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
add new comment
Syndicate content