4 citations · 4 across the 1 of their papers we have counts for
1 paper
Glencora Borradaile, David Eppstein, Pingan Zhu
We show that every graph has an induced pseudoforest of at least n−m/4.5 vertices, an induced partial 2-tree of at least n−m/5 vertices, and an induced planar subgraph of at le…