摘要
１９８７年阿拉维（ＡｌａｖｉＹｏｕｓｅｆ）等人定义了图的一种新分解，即“升分解”（ＡｓｃｅｎｄｉｎｇＳｕｂｇｒａｐｈＤｅｃｏｍｐｏｓｉｔｉｏｎ），并且猜想：任意有正数条边的图都可升分解．该文综述了升分解问题研究的进展情况。
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.
出处
《曲阜师范大学学报（自然科学版）》
CAS
1999年第3期9-11,共3页
Journal of Qufu Normal University(Natural Science)
基金
山东省自然科学基金
关键词
升分解
分拆
星森林
图
整数
ascending subgraph decomposition
conjecture
disassemble
star forest.
