|
|||||
|
|
Planar graphs decomposable into a forest and a matching |
|
| Authors: | Oleg V Borodin Naeem N Sheikh |
| Institution: | a Sobolev Institute of Mathematics, Novosibirsk 630090, Russia b Yakutsk State University, Yakutsk, 677000, Russia c Department of Mathematics, University of Illinois, Urbana, IL 61801, USA |
| 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 |
| 本文献已被 ScienceDirect 等数据库收录！ | |