Partitioning kite-free planar graphs into two forests

Abstract

A kite is a complete graph on four vertices with one edge removed. It is proved that every planar graph without a kite as subgraph can be partitioned into two induced forests. This resolves a conjecture of Raspaud and Wang in 2008.