Abstract
The circular chromatic index of a graph G is the infimum of all rational numbers p/q, such that there exists a circular p/q-edge-coloring of the graph G. It is an interesting problem to determine the set of possible values of the circular chromatic index of k-regular graphs. In this paper, we construct k-regular graphs with circular chromatic index equal to k+a/p for k≥4, p=(2a+1)m+an, a∈{1,2,…,⌊k/2⌋}, and integers m,n≥1, in particular, for all p≥2a2+a+1.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
