| 不含有5-圈和k4平面图的森林分解 |
| |
| 引用本文： | 王涛,吴丽霞.不含有5-圈和k4平面图的森林分解[J].数学杂志,2016,36(2):223-233. |
| |
| 作者姓名： | 王涛 吴丽霞 |
| |
| 作者单位： | 河北师范大学数学与信息科学学院, 河北 石家庄 050024,福州大学离散数学研究中心, 福建 福州 350003 |
| |
| 基金项目： | Supported by National Natural Science Foundation of China (11201113;11271108) |
| |
| 摘 要： | 本文研究了不含有5-圈和K4的平面图的森林分解问题.利用权转移法,证明了任意不含有5-圈和K4的平面图能分解成三个森林,且其中有一个森林的最大度不超过2,这一结果推广了文献2,3]中的结论.
|
| 关 键 词： | 边分解 平面图 5-圈 K4 |
| 收稿时间： | 2013/6/9 0:00:00 |
| 修稿时间： | 2014/2/10 0:00:00 |
DECOMPOSITION OF PLANAR GRAPHS WITHOUT 5-CYCLES OR K4 |
| |
| WANG Tao and WU Li-xia.DECOMPOSITION OF PLANAR GRAPHS WITHOUT 5-CYCLES OR K4[J].Journal of Mathematics,2016,36(2):223-233. |
| |
| Authors: | WANG Tao and WU Li-xia |
| |
| Institution: | College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024, China and Center for Discrete Mathematics, Fuzhou University, Fuzhou 350003, China |
| |
| 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 in2, 3]. |
| |
| Keywords: | edge-decomposition planar graphs 5-cycles K4 |
|
| 点击此处可从《数学杂志》浏览原始摘要信息 |
| 点击此处可从《数学杂志》下载免费的PDF全文 |
|
