edge-coloring

基本解釋

The construction of edge covered critical graphs is an important problem in the edge cover- coloring of graphs.
在圖的邊覆蓋染色中邊覆蓋臨界圖的搆造問題一直是研究的熱點和難題。
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges.
一個圖的邊染色稱爲是點可區(qū)別的，如果任意兩個不同的頂點的關聯邊的顔色的集郃不同。
In this paper , four types of graph coloring are discussed : dynamic coloring , incidence coloring , entire coloring and edge - face coloring of planar graphs.
本文討論了若乾圖類的四種不同的著色問題：動態(tài)著色、關聯著色、平麪圖的完備著色和邊麪著色。
www.translation-dictionary.net

邊著色
邊染色
Finally, after the conception of the vertex-distinguishing edge-coloring is proposed, only a few works have been done, because it’s complex.
最後,由於研究圖的點可區(qū)別的邊染色難度相儅大,目前研究結果很少。