Deleting every $k$-th BFS level of a planar graph leaves tree-width at most $3k$ · Prove2Me

P

Initializing...

Deleting every $k$-th BFS level of a planar graph leaves tree-width at most $3k$ · Prove2Me