31 citations · 256 across the 67 of their papers we have counts for
1 paper · 2 filters
Zdenek Dvorak, Matthias Mnich
Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free plan…