chromatic degree 中文意思是什麼
chromatic degree
解釋
色次-
The strong chromatic index of graphs with maximum degree
最大度等於5的圖的強邊色數 -
This paper studies the relaxed game chromatic number of partial k - tree with the relaxed degree d
本文主要研究的是偏k -樹在鬆弛度為d的情況下的鬆弛競賽色數問題。 -
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 ]中結果的一個很好的改進。 -
We also show strong edge chromatic number of two types of regular graphs with high degree and a note on a result of a. c. burris
給出了兩類高度正則圖的強邊色數,並對a . c . burris的一個結果進行了初步的探討。 -
We prove that halin graphs, 1 - trees and outerplanar graphs satisfy the conjecture presented by n. alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2
證明了halin圖、 1 -樹和外平面圖滿足由n . alon提出的任何一個圖的無圈邊色數不超過其最大度加2的猜想。
分享友人