On Equitable Coloring of Graphs
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 100 === A graph $G$ is proper $k$-colorable if all vertices can be colored with color $1$ to $k$ such that any two adjacent vertices $u$ and $v$ are in different color classes. The chromatic number $\chi(G)$ is the smallest number $k$ for which $G$ is $k$-colorable....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/76554360938974392354 |