Tight relation between the circular chromatic number and the girth of series-parallel graphs

This paper proves the sharpness of an upper bound for the circular chromatic number of series-parallel graphs of large girth.