edge cover coloring

基本解釋

• [數(shù)學(xué)]邊覆蓋染色

英漢例句

雙語(yǔ)例句

• The construction of edge covered critical graphs is an important problem in the edge cover- coloring of graphs.
  在圖的邊覆蓋染色中邊覆蓋臨界圖的搆造問(wèn)題一直是研究的熱點(diǎn)和難題。

• edge cover coloring更多例句

詞組短語(yǔ)

短語(yǔ)

• fractional edge cover coloring 分?jǐn)?shù)邊覆蓋染色
• Super f -edge cover-coloring 超f

• edge cover coloring更多詞組

專業(yè)釋義

數(shù)學(xué)

• 邊覆蓋染色

  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è)重要的定理即對(duì)任意的簡(jiǎn)單圖G，有(G)≤x′(G)≤(G)+1。 1974年，R．P．Gupta對(duì)邊覆蓋染色進(jìn)行了研究。