1、The Upper Chromatic Number of the Cartesian Product of Co-Hypergraphs
反超圖的笛卡兒積的上色數(shù)

2、The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花圖的鄰點(diǎn)可區(qū)別全色數(shù)。

3、A NOTE OF GOLDBERG PROBLEM OF EDGE CHROMATIC NUMBER OF A GRAPH
關(guān)于邊色數(shù)GOLDBERG問(wèn)題的注記

4、ON INCIDENCE CHROMATIC NUMBER OF THREE CLASSES OF CARTESIAN PRODUCT GRAPHS
三類(lèi)笛卡爾積圖的關(guān)聯(lián)色數(shù)

5、The fractional incidence chromatic number is defined.
定義了圖的分?jǐn)?shù)關(guān)聯(lián)色數(shù)。

6、Chromatic number and fractional chromatic number are two important parameters of a graph.
分式色數(shù)和點(diǎn)色數(shù)是圖的兩個(gè)重要參數(shù)。

7、In this paper a estimate of the harmonious chromatic number of a complete 5-ary tree was given.
本文給出了五元完全樹(shù)的調(diào)和著色數(shù)的比較好的估計(jì)。

8、Edge Chromatic Number of Graph K(5,n)
廣義圖K(5,n)的邊色數(shù)

chromatic number翻譯