|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
图的点可区别星边色数的一个上界
, PP. 120-126
Keywords: 点可区别边色数,点可区别星边色数,概率方法
Abstract:
图\,$G$\,的点可区别星边边色数,记为\,$\chi'_{\rmvds}{(G)}$,是图\,$G$\,的点可区别星边染色所用色的最小数目.得到了一些特殊图的星边染色,并证明了若图\,$G$\,是一个最小度不小于\,5,且顶点数不超过\,$\Delta^7$\,的图时,$\chi'_{\rmvds}{(G)}\leqslant{14\Delta^{2}}$,其中\,$\Delta$\,是图\,$G$\,的最大度.
| [1] | {4} BURIS A C, SCHELP R H.
|
| [2] | Vertex-distinguishing proper edge colorings[J]. Journal of Graph Theory,
|
| [3] | 97, {26(2)}: 74-82.
|
| [4] | {5} ALON, SADAKOV B, ZAKS A.
|
| [5] | Acyclic edge coloringa of graphs[J]. Journal of Graph
|
| [6] | Theory, 2001, 37: 157-167.
|
| [7] | {6} RAHUL M, NARAYANAN N, SUBRAMANIAN C R.
|
| [8] | Improved bounds on acyclic edge clouring[J]. Discrete Mathematics,
|
| [9] | {2007, 307: 3063-3069}.
|
| [10] | {7} MICHAEL M, BRUCE R.
|
| [11] | Graph Coloring and the Probabilistic Method[M]. New York:
|
| [12] | Springer-Verlag, 2002.
|
| [13] | {8} BONDY J A, MURTY U S R.
|
| [14] | Graph Theory with Applications[M]. New York: Macmillan Press Ltd,
|
| [15] | 1976.
|
| [16] | {9} ALON N, SPENCER J.
|
| [17] | The Probabilistic Method[M]. New York: John
|
| [18] | Wiley and Sons, 1992.
|
| [19] | {10} LIU X S, ZHU Z Q.
|
| [20] | An Upper Bound on the Vertex-Distinguishing IE-Total
|
| [21] | Chromatic Number of Graphs[J]. Journal of Shandong University,
|
| [22] | 09, {44(10)}: 14-16.
|
| [23] | {11}LIU X S, AN M Q, GAO Y.
|
| [24] | chromatic number of a graph[J]. Journal of Mathematical Research \&
|
| [25] | Exposition, 2009, {29(2)}: 343-348.
|
| [26] | {12} LIU X S, WEI Z Y.
|
| [27] | An upper bound for the vertex-distinguishing acyclic edge
|
| [28] | chromatic number of graphs[J]. Journal of Lanzhou University, 2010,
|
| [29] | {46(5)}: 75-78.
|
| [30] | {1} GUILLAUME F, BRUCE R. Star coloring of graphs[J].
|
| [31] | Journal of Graph Theory, 2004, {47(3)}: 163-182.
|
| [32] | {2} LIU X S, DENG K.
|
| [33] | An upper bound on the star edge chromatic index of graphs
|
| [34] | with $\Delta\geqslant 7$[J]. Journal of Lanzhou University,
|
| [35] | 08, {44(2)}: 98-100.
|
| [36] | {3} CRISSTINA B, AMEL H B, Li H.
|
| [37] | On the vertex-distinguishing proper edge-colorings[J].
|
| [38] | Journal of Combinatorial Theory Series B,
|
| [39] | 99, {75(2)}: 288-301.
|
| [40] | An upper bound for the adjacent vertex-distinguishing total
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
