Maximum 4-degenerate subgraph of a planar graph

Robert Lukoťka, Ján Mazák, Xuding Zhu

A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with…