无环图G的边色数(edge chromatic number)r(G)是指使G为七边 可着色的那些七的最小值。可以验证,图2.4中的图没有正常的3边着色:因 此该图的边色数等于4。
基于48个网页-相关网页
We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of A. C. Burris.
给出了两类高度正则图的强边色数,并对A.C.Burris的一个结果进行了初步的探讨。
参考来源 - 若干图着色问题的研究The star edge coloring of tree is studied,the star chromatic index of two kinds of special trees is obtained,and an attainable upper bound of star chromatic index of tree is proved.
研究了树的星边染色,确定了两类特殊树的星边色数,并得到了一般树的星边色数的一个可达上界。
参考来源 - 树的星边染色·2,447,543篇论文数据,部分数据来源于NoteExpress
得到了扇和完全等二部图联图的边色数。
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
同时还确定了所有系列-平行图的边色数。
The chromatic index of any series parallel graph is also determined.
我们将介绍顶点色数和边色数的一些基本性质。
We shall present some of the basic properties of the vertex and edge chromatic Numbers.
应用推荐