外平面图度有限制的k-荫度

The degree-constrained k-arboricity of outerplanar graphs

令ak(G)表示最大度不超过k且能覆盖图G所有边的森林的最小数目.则对于任意的外平面图,当2≤k<Δ(G)时有ak(G)=「Δ(G)/k﹁.

Let ak （G） be the least number of forests of maximum degree not exceeding k which cover the edges of a gaph G Then ak（G） = [Δ（ G）/k] for any outerplanar graph G having2≤k〈Δ（G）