“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 2368 |
|
||||
| Abstract: | |||||
|
This paper gives a sufficient condition for a graph G to have
its circular chromatic number equal to its chromatic number. By
using this result, we prove that for any integer t ≥ 1, there
exists an integer n such that for all k ≥ n,
χc(Mt(Kk))=χ(Mt(Kk)).
Download TeX format |
|||||
| back to top | |||||
