有限图的边荫度分解

Edge arboricity decomposition of a finite graph

设有限图Ｇ＝（Ｖ，Ｅ），Ｐ＝｛Ｖ１，Ｖ２，…，Ｖｒ｝为Ｇ的一个划分，收缩Ｖｉ为一点ｖｉ（ｉ＝１，…，ｒ），得到Ｇ的收缩图ＧＰ＝（ＶＰ，ＥＰ）．文中通过对Ｇ递归地进行收缩，改进了Ｇ的边不重生成树数目的上界。

Suppose a finite graph G=(V,E),P={V 1,V 2,…,V r} is a partition of G ,contracting V i into a vertex v i(i=1,…,r) ,then result in a graph G P .This paper develops a method of contraction for G and improves the upper boundary of the number of edge disjoint spanning trees of a finite graph.It gives a specific way of edge arboricity decomposition.