# Does a (finite) planar graph with minimum degree 3 contain a neighbourhood consisting of bounded degree vertices?

Does a (finite) planar graph $$G$$ with minimum degree 3 contain a vertex $$v$$ for which all vertices of distance r=2 neighbourhood consisting of bounded degree vertices?

If this is true, does it still work for larger r and on bounded genus graphs?