| 一些唯一3-着色图 |
| |
| 引用本文： | 李雪峰. 一些唯一3-着色图[J]. 安徽大学学报(自然科学版), 2009, 33(4) |
| |
| 作者姓名： | 李雪峰 |
| |
| 作者单位： | 西安邮电学院,应用数理系,陕西,西安,710121 |
| |
| 基金项目： | 国家自然科学基金资助项目(60672026);;陕西省教育厅自然科学基金资助项目(2006A12) |
| |
| 摘 要： | 如果用k种颜色对图G的顶点进行着色,使相邻顶点具有不同的颜色,那么称此种着色为G的一个正常k-着色(简称k-着色).图G的色数χ(G)是指使G可正常着色的最少颜色数,其中具有相同颜色的顶点集称为一个色类.如果对G的所有χ(G)-着色产生的色类是相同的,那么称G是唯一χ(G)-着色的.论文给出了一些唯一3-着色图.
|
| 关 键 词： | 着色 色数 唯一3-着色 |
Some uniquely 3-colorable graph |
| |
| LI Xue-feng. Some uniquely 3-colorable graph[J]. Journal of Anhui University(Natural Sciences), 2009, 33(4) |
| |
| Authors: | LI Xue-feng |
| |
| Affiliation: | Department of Applied Mathematics and Physics;Xi'an Institute of Post and Telecom.;Xi'an 710121;China |
| |
| 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. |
| |
| Keywords: | coloring color number unique 3 coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
