@article{32acde57245d4cd88215a6c8e307d2d2,
title = "Decomposing a planar graph with girth 9 into a forest and a matching",
abstract = "W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9.",
author = "Borodin, {Oleg V.} and Kostochka, {Alexandr V.} and Sheikh, {Naeem N.} and Gexin Yu",
note = "Funding Information: The first author{\textquoteright}s research was supported in part by the RFBR grants 05-01-00816 and 06-01-00694. The second author{\textquoteright}s research was supported in part by the NSF grants DMS-0400498 and DMS-0650784 and the RFBR grant 05-01-00816. The last author{\textquoteright}s research was supported in part by the NSF grant DMS-0652306.",
year = "2008",
month = jul,
doi = "10.1016/j.ejc.2007.06.020",
language = "English (US)",
volume = "29",
pages = "1235--1241",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press",
number = "5",
}