Abstract
The circular chromatic number χ c(G) of a graph G (also known as ‘the star-chromatic number’), is a natural generalization of the chromatic number of a graph. In this paper, we survey results on this topic, concentrating on the relations among the circular chromatic number, the chromatic number and some other parameters of a graph. Some of the results and/or proofs presented here are new. The last section is devoted to open problems. We pose 28 open problems, and discuss partial results and give references (if any) for each of these problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.