K-,5-，K-,6-的[1，1，2]-染色.pdf

1、河北工業(yè)大學碩士學位論文K，K的[1，1，2]-染色姓名：王曉軍申請學位級別：碩士專業(yè)：應用數(shù)學指導教師：徐常青20081201K5, K6? [1, 1, 2]? / C[1, 1, 2]?COLORING OF K5 AND K6ABSTRACTLet G = (V (G), E(G)) be a simple graph. Given non-negative integersr, s, and t, an [r, s, t]?c

2、oloring of G is a mapping c from V (G) ? E(G) tothe color set {0, 1, . . . , k ? 1} such that |c(vi) ? c(vj)| ≥ r for every twoadjacent vertices vi, vj, |c(ei) ? c(ej)| ≥ s for every two adjacent edgesei, ej, and |c(vi)

3、? c(ej)| ≥ t for all two pairs of incident vertices andedges, respectively. The [r, s, t]?chromatic number χr,s,t(G) of G is definedto be the minimum k such that G admits an [r, s, t]?coloring. We willrespectively discus