【摘要】 如果用k种颜色对图G的顶点进行着色,使相邻顶点具有不同的颜色,那么称此种着色为G的一个正常k-着色(简称k-着色).图G的色数χ(G)是指使G可正常着色的最少颜色数,其中具有相同颜色的顶点集称为一个色类.如果对G的所有χ(G)-着色产生的色类是相同的,那么称G是唯一χ(G)-着色的.论文给出了一些唯一3-着色图.更多还原

【Abstract】 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.更多还原