提示
刘桂真
-
98浏览
-
0点赞
-
0收藏
-
0分享
-
67下载
-
0评论
-
引用
期刊论文
On (g, f)-Uniform Graphs*
，-0001，（）：
A graph G is called a (g, f)-uniform graph if for each edge of G, there is a (g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of this condition are discussed. In particular, some simple suffcient conditions for a graph to be an [a, b]-uniform graph are obtained for a≤b.
【免责声明】以下全部内容由[刘桂真]上传于[2005年07月21日 23时16分19秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
