关于图的升分解研究的进展

ADVANCES ON THE RESEARCH ABOUT ASCENDING SUBGRAPH DECOMPOSITION

１９８７年阿拉维（ＡｌａｖｉＹｏｕｓｅｆ）等人定义了图的一种新分解，即“升分解”（ＡｓｃｅｎｄｉｎｇＳｕｂｇｒａｐｈＤｅｃｏｍｐｏｓｉｔｉｏｎ），并且猜想：任意有正数条边的图都可升分解．该文综述了升分解问题研究的进展情况。

Alavi Y and others have given a new subgraph decomposition, which is called Ascending Subgraph Decomposition, They have also conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper, some advances on the researches about ascending subgraph decomposition problem are synthesized briefly, and several suggestions about the further study in this field are made.