Title of article
Planar graphs decomposable into a forest and a matching
Author/Authors
Borodin، نويسنده , , Oleg V. and Ivanova، نويسنده , , Anna O. and Kostochka، نويسنده , , Alexandr V. and Sheikh، نويسنده , , Naeem N.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
3
From page
277
To page
279
Abstract
He, Hou, Lih, Shao, Wang, and Zhu showed that a planar graph of girth 11 can be decomposed into a forest and a matching. Borodin, Kostochka, Sheikh, and Yu improved the bound on girth to 9. We give sufficient conditions for a planar graph with 3-cycles to be decomposable into a forest and a matching.
Keywords
Planar graphs , Edge decompositions , Graph decompositions
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1598486
Link To Document