2) On Fall Colorings of Graphs
有关图的满着色
3) incidence coloring
关联着色
1.
An incidence coloring of graph G is a mapping from the incidence set I(G) to color set C such that any two neighborly incidences are assigned different colors.
图G的关联着色是从关联集I(G)到颜色集C的一个映射使得任意两个相邻的关联不着同色。
2.
The concepts of adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence coloring number of graphs are defined on the basis of the concept of incidence coloring of graphs.
在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数,研究了圈、完全二部图、Cm。
3.
We presents a genetic algorithm for the incidence coloring on graphs.
给出了一种用于图的关联着色的遗传算法。
4) graph coloring
图的着色
1.
The k-Graph Coloring procedure was introduced.
图的着色问题是一典型的优化的问题,用蚂蚁算法求解图着色问题,可保证程序运行的高效率及高收敛性,有效避免了解此问题时极易陷入局部极小的缺陷,并且能较快的收敛。
5) Relationship coloring chart
关系着色图
6) On Flaw Colourings of Graphs
关于图的瑕边着色
补充资料：有关
1.有关系。 2.关涉﹐涉及。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条