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]
@article{WangZ11-4,
title = {Decomposing a planar graph with girth at least 8 into a forest and a matching},
author = {Yingqian Wang and Qijun Zhang},
year = {2011},
doi = {10.1016/j.disc.2011.01.019},
url = {http://dx.doi.org/10.1016/j.disc.2011.01.019},
tags = {planar graph, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/WangZ11-4},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {311},
number = {10-11},
pages = {844-849},
}