| 外平面图度有限制的k-荫度 |
| |
| 引用本文： | 马勤.外平面图度有限制的k-荫度[J].山东大学学报(理学版),2007,42(10):41-43. |
| |
| 作者姓名： | 马勤 |
| |
| 作者单位： | 山东大学,数学与系统科学学院,山东,济南,250100 |
| |
| 摘 要： | 令ak(G)表示最大度不超过k且能覆盖图G所有边的森林的最小数目.则对于任意的外平面图，当2≤k＜Δ(G)时有ak(G)=「Δ(G)/k.
|
| 关 键 词： | 荫度 k-荫度 外平面图 |
| 文章编号： | 1671-9352（2007）10-0041-03 |
| 修稿时间： | 2007-03-31 |
The degree-constrained k-arboricity of outerplanar graphs |
| |
| MA Qin.The degree-constrained k-arboricity of outerplanar graphs[J].Journal of Shandong University,2007,42(10):41-43. |
| |
| Authors: | MA Qin |
| |
| Institution: | School of Mathematics and System Science, Shandong University, Jinan 250100, Shandong, China |
| |
| Abstract: | Let ak(G) be the least number of forests of maximum degree not exceeding k which cover the edges of a graph G. Then ak(G)=「Δ(G)/k for any outerplanar graph G having 2≤k＜Δ(G). |
| |
| Keywords: | arboricity k-arboricity outerplanar graph |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
