Decomposing a planar graph with girth 9 into a forest and a matching
Author/Authors :
Borodin، نويسنده , , Oleg V. and Kostochka، نويسنده , , Alexandr V. and Sheikh، نويسنده , , Naeem N. and Yu، نويسنده , , Gexin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
7
From page :
1235
To page :
1241
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.
