标题:THE METHOD OF COLORING IN GRAPHS AND ITS APPLICATION
作者:Guizhen LIU[1];Jianfeng HOU[2]
通讯作者:Liu, G
作者机构:[Guizhen LIU]School of Mathematics, Shandong University, Jinan 250100, China.;[Jianfeng HOU]Center for Discrete Mathematics, Fuzhou University, Fuzhou 更多
会议名称:3rd International Symposium on Optimization and Systems Biology
会议日期:SEP 20-22, 2009
来源:系统科学与复杂性学报:英文版
出版年:2010
卷:23
期:5
页码:951-960
DOI:10.1007/s11424-010-0211-2
关键词:着色方法;应用;作者;无圈边着色;边覆盖染色;网络设计;图的着色;图着色;
摘要:Graph coloring has interesting real life applications in optimization and network design. In this paper some new results on the acyclic-edge coloring, f-edge coloring, g-edge cover coloring, (g, f)-coloring and equitable edge-coloring of graphs are introduced. In particular, some new results related to the above colorings obtained by the authors are given. Some new problems and conjectures are presented.
收录类别:CPCI-S;EI;SCOPUS;SCIE
资源类型:会议论文;期刊论文
原文链接:http://lib.cqvip.com/qk/84400X/201005/35778091.html
TOP