数学杂志2016，Vol.36Issue(2)：223-233,11.
不含有5-圈和k4平面图的森林分解
DECOMPOSITION OF PLANAR GRAPHS WITHOUT 5-CYCLES OR K4
摘要
Abstract
In this paper, we consider the forest decomposition of planar graphs without 5-cycles or K4. By the rules of discharging, we prove that every planar graph without 5-cycles or K4 can be decomposed into three forests with one whose maximum degree is at most 2, which generalizes the results in [2, 3].关键词
边分解/平面图/5-圈/K4Key words
edge-decomposition/planar graphs/5-cycles/K4分类
数理科学引用本文复制引用
王涛,吴丽霞..不含有5-圈和k4平面图的森林分解[J].数学杂志,2016,36(2):223-233,11.基金项目
Supported by National Natural Science Foundation of China (11201113 （）
11271108) （）
