Subgraphs with restricted degrees of their vertices in planar graphs Original Research Article

We prove that every 3-connected planar graph G of order at least k contains a connected subgraph H on k vertices each of which has degree (in G) at most 4k + 3, the bound 4k + 3 being best possible.