摘要
Ｇａｌａｉ提出的小路分解（ＳＰＤ）猜想：任一连通图的路分解的路数的最小数目至多为［（ｎ＋１）／２］，迄今还未完全得以解决而这个问题在运筹。
The conjecture “The lowest path number of the path decomposed with any connected graph is no more than [(n+1)/2]” given by Gallai is still awaiting a convincing solution In this paper, we give a proof of the conjecture under certain conditions by use of Loaszs′ theorem
出处
《福州大学学报（自然科学版）》
CAS
CSCD
1998年第2期6-10,共5页
Journal of Fuzhou University(Natural Science Edition)
关键词
路分解
连通图
猜想
图
path decomposition
connected graph
conjecture
