|
扩展功能
|
|
| 本文信息 | |
 |
Supporting info |
|
PDF(179KB) |
|
参考文献[PDF] |
|
参考文献 |
| 服务与反馈 | |
|
加入引用管理器 |
|
引用本文 |
|
Email Alert |
|
文章反馈 |
|
浏览反馈信息 |
| 本文关键词相关文章 | |
 |
荫度 |
|
k-荫度 |
|
外平面图 |
| 本文作者相关文章 | |
|
马 勤 |
| PubMed | |
|
Article by |
外平面图度有限制的k-荫度
马 勤
山东大学数学与系统科学学院， 山东 济南 250100
令ak(G)表示最大度不超过k且能覆盖图G所有边的森林的最小数目.则对于任意的外平面图，当2≤k＜Δ(G)时有ak(G)=「Δ(G)/k.
The degree-constrained k-arboricity of outerplanar graphs
School of Mathematics and System Science, Shandong Univ., Jinan 250100, Shandong, China
School of Mathematics and System Science, Shandong Univ., Jinan 250100, Shandong, China
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).