chromatic number 中文意思是什麼

chromatic number 解釋
色數, 顏色種數
  • chromatic : adj 1 色彩的；著色的，彩色的。2 【生物學】染色質的。3 【音樂】半音（階）的。chromatic printing 套...
  • number : n 1 數；數字；〈pl 〉算術。2 （汽車等的）號碼；第…，第…卷，第…期〈通常略作 No （復數 Nos ），用於...
  1. It is not easy to see that there are triangle-free graphs of large chromatic number.

    很不容易看出這里是否存在色數很大而沒有三角形的圖。
  2. Girth and fractional chromatic number of seriel parallel graphs

    系列平行圖的圍長和分數色數
  3. An upper bound of adjacent strong edge chromatic number

    一類圖的鄰強邊色數的上界
  4. Using the combinatorial method of constructibility and the technique of exchanging colors, we present the best upper bounds of dynamic chromatic number of halin graphs and sp graphs, and determine the dynamic chromatic number of a type of sp graphs, we determine the incidence chromatic number of some descartes product graphs and some join graphs. at last we determine the entire coloring number of 1 - tree and prove a conjecture of edge - face coloring

    利用構造性組合方法和換色技巧給出了halin圖和系列平行圖動態色數的最小上界，並確定了一類特殊系列平行圖的動態色數，確定了某些笛卡兒積圖和某些聯圖的關聯色數，確定了1 -樹圖的完備色數並證明了有關邊面著色的一個猜想。
  5. Adjacent strong edge chromatic number of some corona graphs

    幾類冠圖的鄰強邊色數
  6. Some results about the circular chromatic number of mm

    圖的循環色數的若干結果
  7. Integer programming of circular chromatic number

    計算圓色數的混合整數規劃方法
  8. On the adjacent vertex - distinguishing edge chromatic number of wm wn

    的鄰強邊色數
  9. A note on the upper bound of adjacent vertex distinguishing chromatic number of graphs

    關于圖鄰點可區別上界的一點注
  10. Edge - face chromatic number of 2 - connected 1 - tree with

    樹圖的邊面色數
  11. Adjacent strong edge chromatic number of sm pn

    的鄰強邊染色
  12. Among them the applications with the general local lemma arc the most important, such as acyclic edge colorings of graphs. we prove that the acyclic edge chromatic number of g is less than or equal to a + 2 for any graph g whose girth is at least 700 log

    ） sz局部引理給出應用實例，即無圈邊染色，證明了當圖g的圍長大於等於700 log時，圖g的無圈邊色教小於等於+ 2然後，用概率論的方法證明了幾種形式的lov （
  13. This paper studies the relaxed game chromatic number of partial k - tree with the relaxed degree d

    本文主要研究的是偏k -樹在鬆弛度為d的情況下的鬆弛競賽色數問題。
  14. The relaxed game chromatic number of tree, outerplanar graphs, partial k - tree and pseudo partial k - tree have been studied by many researchers home and abroad, this paper further studied the relaxed game chromatic number of partial k - tree based on the known research, according to appling a new activation strategy, we proved if the relaxed degree d > 2k + 1, then for this ( r, d ) - relaxed coloring game, we have ( 2k + 1 ) - xg ( g ) < k + 1, it is an improvement about the result in paper [ 2 ]

    對樹，外平面圖，偏k -樹及偽偏k -樹的鬆弛競賽染色已在不同程度上得到了一些研究，並取得了一些相應的結果。本文正是在已有研究的基礎上，對偏k -樹的鬆弛競賽色數進行了進一步的研究，使得在鬆弛度d不小於2k + 1的情況下，對這個（ r ， d ） -鬆弛競賽染色，有，它是文章[ 2 ]中結果的一個很好的改進。
  15. The edge - chromatic number of some extended mycielski graphs

    圖的邊色數
  16. Vertex - distinguishing edge chromatic number of pmvpn

    的點可區別邊色數
  17. The edge - chromatic number of some mycielski graphs

    圖的臨強邊色數
  18. About the edge - chromatic number of mycielski graphs

    圖的邊色數
  19. A family planar graphs with star chromatic number between two and three

    一類星色數介於2與3之間的平面圖
  20. Since 1988 vince proposed the conception of star - chromatic number, a large amount of study about star - chromatic number, circular chromatic number and the way to do study have been achieved. then graph g were produced. lt has vertex set { 0, 1, 2, . .,

    1988年， vince提出星色數的概念之後，得到了大量的關于星色數、圈色數的研究。引出了一類特殊的圖： g _ d ~ k圖，它有點集{ 0 ， 1 ， 2 ，
分享友人
分享到 Line

分享到臉書