| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654825 | European Journal of Combinatorics | 2008 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu,