Sciweavers

DMTCS
2010

An improved bound on the largest induced forests for triangle-free planar graphs

13 years 1 months ago
An improved bound on the largest induced forests for triangle-free planar graphs
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
Added 02 Mar 2011
Updated 02 Mar 2011
Type Journal
Year 2010
Where DMTCS
Authors Lukasz Kowalik, Borut Luzar, Riste Skrekovski
Comments (0)