DOI: 10.1002/jgt.23062 ISSN: 0364-9024
Partitioning kite‐free planar graphs into two forests
Yang Wang, Yiqiao Wang, Ko‐Wei Lih- Geometry and Topology
- Discrete Mathematics and Combinatorics
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.