edge cover coloring
基本解释
- [数学]边覆盖染色
英汉例句
- The construction of edge covered critical graphs is an important problem in the edge cover- coloring of graphs.
在图的边覆盖染色中边覆盖临界图的构造问题一直是研究的热点和难题。
双语例句
词组短语
- fractional edge cover coloring 分数边覆盖染色
- Super f -edge cover-coloring 超f
短语
专业释义
- 边覆盖染色
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对边覆盖染色进行了研究。