Circular Coloring and Mycielski Construction

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper, we investigate circular chromatic number of Mycielski construction of graphs. It was shown in \cite{MR2279672} that $t^{{\rm th}}$ Mycielskian of the Kneser graph $KG(m,n)$ has the same circular chromatic number and chromatic number provided that $m+t$ is an even integer. We prove that if $m$ is large enough, then $\chi(M^t(KG(m,n)))=\chi_c(M^t(KG(m,n)))$ where $M^t$ is $t^{{\rm th}}$ Mycielskian. Also, we consider the generalized Kneser graph $KG(m,n,s)$ and show that there exists a threshold $m(n,s,t)$ such that $\chi(M^t(KG(m,n,s)))=\chi_c(M^t(KG(m,n,s)))$ for $m\geq m(n,s,t)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Circular Coloring and Mycielski Construction 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 Circular Coloring and Mycielski Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circular Coloring and Mycielski Construction will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-214504

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.