Decomposing a planar graph with girth 9 into a forest and a matching

https://doi.org/10.1016/j.ejc.2007.06.020Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)