提示
刘桂真
-
66浏览
-
0点赞
-
0收藏
-
0分享
-
70下载
-
0评论
-
引用
期刊论文
A Polynomial Algorithm for Finding (g, f)-Colorings Orthogonal to Stars in Bipartite Graphs *
，-0001，（）：
Let G be a bipartite graph with vertex set V (G) and edge set E(G), and let g and f be two nonnegative integer-valued functions defined on V (G) such that g(x) ≤ f(x) for every vertex x of V (G). A (g, f)-coloring of G is a generalized edge-coloring in which each color appears at each vertex x at least g(x) and at most f(x) times. In this paper a polynomial algorithm to find a (g, f)-coloring of a bipartite graph with some constraints using the minimum number of colors is given. Furthermore, we show that the results in this paper are best possible.
【免责声明】以下全部内容由[刘桂真]上传于[2005年07月21日 23时19分42秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
