| Total Coloring of G×P_n and G×C_n |
| |
| 作者姓名： | YANG Yi-xian LIU Huan-ping |
| |
| 作者单位： | Information Security Center,Department of Information Engineering,Beijing University of Posts and Telecommunications,Beijing 100876,P. R. China |
| |
| 基金项目： | Project supported by National Natural Science Foundation(No. 69882002) and "973" project (No. G1999035805) |
| |
| 摘 要： | 1 IntroductionGraph treated in this paper are finite, undirected, loopless and without multiple edges. For a graph G, we use V(G) (resp.E(G)) to denote its set of vertices (resp.edges).The n colors are labled by 0,1,(, n-1, respectively.A total coloring of a graph G is a map , f, from the set E(G)∪V(G) to the set of colors C such that no two incident nor adjacent element of E(G)∪V(G) are painted by the same color. If |C | = k, then G is said to be k-colorable.The total chromatic numb…
|
| 本文献已被 CNKI 等数据库收录！ |
|
