摘要
本文讨论图的(g,f)-因子分解问题,推广了文[1]关于图的因子分解的理论,改进了文[2]的一些结果,给出了一个图G是(g,f)-可因子化的若干充分条件.
This paper discusses the problems of (g, f)-factorizations of graphs. It popularizes those theorems on factorizations of graphs in [1] and improves some results in [2]. Some sufficient conditions for a graph to be (g,f)-factorable are given.
出处
《应用数学》
CSCD
北大核心
1996年第1期117-120,共4页
Mathematica Applicata