摘要
Ａｌａｖｉ［１］给出了图的升分解概念，并猜想每一图都可升分解．本文证明了边数为（）的图Ｇ当边色数Ｘ＇（Ｇ）≤（ｎ＋２）／２时可升分解为．
Alavi has given the definition of the ascending subgraph decomposition. Heconjectured that every graph of positive size has an asceuding subgraph decomposition.In this paper it is proved that a graph G of size ( )has an ascending subgraphdecomposition {G_i}, 1≤i≤n, with G_i iK_2 if the edge chromatic number x'(G)≤(n + 2)/2.
