incidence coloring number 关联色数
fractional incidence coloring 分数关联着色
adjacent vertex distinguishing incidence coloring 邻点可区别关联着色
adjacent vertex-distinguishing incidence coloring 邻点可区别关联着色
incidence game coloring 关联对策染色
Firstly, We present a genetic algorithm for the incidence coloring on graphs and Steiner tree problem.
首先给出了图的关联着色和文件传输问题的遗传算法。
参考来源 - DNA计算和遗传算法的编码与几个优化模型的研究·2,447,543篇论文数据，部分数据来源于NoteExpress
Secondly, the article introduce the concept of strong edge coloring and incidence coloring.
其次，引入强边着色、关联着色的定义。
The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacent vertices are different.
邻点可区别关联着色是使得相邻顶点的颜色集不同的关联着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
应用推荐