Some Colorings of the Chessboard Graph
Zhang Hong-mei, YE Guo-yan · Shuxue de shijian yu renshi · 2011
The coloring problem is the main content of graph theory and it has theoretical and practical significance.In this paper,we discuss the adjacent vertex-distinguishing edge coloring,the adjacent vertex-distinguishing total coloring of the chessboard graph and give their corresponding chromatic numbers.