The Circular Chromatic Number of the Mycielskian of Mt(Kn)

Details The Circular Chromatic Number of the Mycielskian of Mt(Kn) The Circular Chromatic Number of the Mycielskian of Mt(Kn)

2009-01-15

arxiv.org/abs/0901.2259v1

Mathematics

Combinatorics

10 pages

Scientific paper

As a natural generalization of chromatic number of a graph, the circular chromatic number of graphs (or the star chromatic number) was introduced by A.Vince in 1988. Let $M^t(G)$ denote the $t$th iterated Mycielski graph of $G$. It was conjectured by Chang, Huang and Zhu(Discrete mathematics,205(1999), 23-37) that for all $n \ge t+2, \chi_c(M^t(K_n))=\chi(M^t(K_n))=n+t.$ In 2004, D.D.F. Liu proved the conjecture when $t\ge 2$, $n\ge 2^{t-1}+2t-2$. In this paper,we show that the result can be strengthened to the following: if $t\ge 4$, $n\ge {11/12}2^{t-1}+2t+{1/3}$, then $\chi_c(M^t(K_n))=\chi(M^t(K_n))$.

Affiliated with

Also associated with

No associations

Rating

The Circular Chromatic Number of the Mycielskian of Mt(Kn) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Circular Chromatic Number of the Mycielskian of Mt(Kn), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Circular Chromatic Number of the Mycielskian of Mt(Kn) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-590092