Some uniquely 3-colorable graph
LI Xue-feng · Journal of Anhui University · 2009
Let k was a positive integer,one coloring of graph G was said a normal k-coloring if its vertices were colored by k colors so that no two adjacent vertices had the same color.The chromatic number χ(G)of graph G was the least color number so that G was normally colored,and the vertices with the same color was said to be one color class.If every χ(G)-coloring of G gave the same color classes,then G was said to be a uniquely χ(G) colorable graph.In the paper,some uniquely 3 colorable graphs were obtained.