edge cover coloring
基本解释
- [數學]邊覆蓋染色
英汉例句
- The construction of edge covered critical graphs is an important problem in the edge cover- coloring of graphs.
在圖的邊覆蓋染色中邊覆蓋臨界圖的搆造問題一直是研究的熱點和難題。
雙語例句
专业释义
- 邊覆蓋染色
In 1964,Vizing proved the famous Vizing's theorem:(G)≤x′(G)≤(G)+1 for any simple graph G. In 1974,R. P. Gupta studied the edge cover coloring problem.
1964年,Vizing得出一個重要的定理即對任意的簡單圖G,有(G)≤x′(G)≤(G)+1。 1974年,R.P.Gupta對邊覆蓋染色進行了研究。