Circular Chromatic Indices of Regular Graphs
Cheyu Lin, Tsai‐Lien Wong, Xuding Zhu · Journal of Graph Theory · 2013
Abstract The circular chromatic index of a graph G, written , is the minimum r permitting a function such that whenever e and are adjacent. It is known that for any , there is a 3‐regular simple graph G with . This article proves the following results: Assume is an odd integer. For any , there is an n‐regular simple graph G with . For any , there is an n‐regular multigraph G with .