Decomposing a planar graph with girth at least 8 into a forest and a matching

Yingqian Wang, Qijun Zhang. Decomposing a planar graph with girth at least 8 into a forest and a matching. Discrete Mathematics, 311(10-11):844-849, 2011. [doi]

Abstract

Abstract is missing.