European Journal of CombinatoricsVolume 29, Issue 5, July 2008, Pages 1235-1241Decomposing a planar graph with girth 9 into a forest and a matchingAuthor links open overlay panelOleg V. Borodin a, Alexandr V. Kostochka b a, Naeem N. Sheikh b, Gexin Yu cShow moreShareCitehttps://doi.org/10.1016/j.ejc.2007.06.020Get rights and contentUnder an Elsevier user licenseopen archiveAbstractW. 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.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 2007 Elsevier Ltd. All rights reserved.