Mathematics – Combinatorics
Scientific paper
2011-05-31
Mathematics
Combinatorics
Scientific paper
For every integer $r\ge3$ and every $\eps>0$ we construct a graph with maximum degree $r-1$ whose circular total chromatic number is in the interval $(r,r+\eps)$. This proves that (i) every integer $r\ge3$ is an accumulation point of the set of circular total chromatic numbers of graphs, and (ii) for every $\Delta\ge2$, the set of circular total chromatic numbers of graphs with maximum degree $\Delta$ is infinite. All these results hold for the set of circular total chromatic numbers of bipartite graphs as well.
No associations
LandOfFree
On the Set of Circular Total Chromatic Numbers of Graphs 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 On the Set of Circular Total Chromatic Numbers of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Set of Circular Total Chromatic Numbers of Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-323858