|
OALib Journal期刊
ISSN: 2333-9721
费用：99美元
|
|
|
|
若干圈的广义冠图的(2,1)-全标号
, PP. 124-130
Keywords: (2,1)-全标号,(2,1)-全标号数,全染色,广义冠图
Abstract:
研究了与频率分配有关的一种染色问题:(2,1)-全标号,它是对图的全染色的一种推广,根据圈的广义冠图的构造特征,利用穷染法,给出了一种标号方法,得到了几类圈的广义冠图的(2,1)-全标号数.
| [1] | GEORGES J P, MAURO D W, WHITTLESEY M A. Relating path coring to
|
| [2] | vertex labelling graphs with a condition at distance two[J].
|
| [3] | Discrete Math, 1994, 135: 103-111.
|
| [4] | {4}
|
| [5] | MOLLOY M, SALAVATIPOUR M R. A bound on the chromatic number of the
|
| [6] | square of a planar graph[J]. J Combin Theory Ser B, 2005, 94:
|
| [7] | 9-213.
|
| [8] | {5}
|
| [9] | WANG W. The $L(2,1)$-labelling of trees[J]. Discrete Appl Math,
|
| [10] | 06, 154: 598-603.
|
| [11] | {6}
|
| [12] | WHITTLESEY M A, GEORGES J P, MAURO D W. On the $\lambda$-number of
|
| [13] | Q_{n}$ and related graphs[J]. SIAM J Discrete Math, 1995, 8(4):
|
| [14] | 9-506.
|
| [15] | {7}
|
| [16] | HAVET F, YU M L. $(p,1)$-Total labelling of graphs[J]. Discrete
|
| [17] | Math, 2008, 308(4): 496-513.
|
| [18] | {8}
|
| [19] | HULGAN J. Concise proofs for adjacent-vertex distinguishing total
|
| [20] | colorings[J]. Discrete Math, 2009, 309(8): 2548-2550.
|
| [21] | {9}
|
| [22] | ZHANG Z F, CHEN X E, LI J W, et al. On the adjacent vertex strongly
|
| [23] | distinguishing total coloring of graphs[J]. Science in China Ser
|
| [24] | A-Math, 2008, 51(3): 427-436.
|
| [25] | {10}
|
| [26] | WANG W. Total chromatic number of planar graphs with maximum degree
|
| [27] | ten[J]. J Graph Theory, 2007, 54: 91-102.
|
| [28] | {11}
|
| [29] | CHEN X E, ZHANG Z F. Adjacent-vertex-distinguishing total chromatic
|
| [30] | number of $P_{m}\times K_{n}$[J]. Journal of Mathematical Research
|
| [31] | and Exposition, 2006, 26(3): 489-494.
|
| [32] | {12}
|
| [33] | 8-944.\\
|
| [34] | TIAN J J. The 2-strong edge-coloring of some general crown graphs of
|
| [35] | circle[J]. Journal of Math, 2011, 31(5): 938-944 (in chinese).
|
| [36] | {13}
|
| [37] | {1}
|
| [38] | GRIGGS J R, YEH R K. Labelling graphs with a condition at distance
|
| [39] | two[J]. SIAM J Discrete Math, 1992, 5(4): 586-595.
|
| [40] | {2}
|
| [41] | GEORGES J P, MAURO D W, STEIN M I. Labelling products of complete
|
| [42] | graphs with a condition at distance two[J]. SIAM J Discrete Math,
|
| [43] | 00, 14: 28-35.
|
| [44] | {3}
|
| [45] | CHEN D, WANG W F. (2,1)-Total labelling of graphs[J]. Discrete
|
| [46] | Applied Math, 2007, 155: 2585-2593.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|
