In this note we consider colorings of series-parallel graphs. Specifically, we provide bounds on their fractional and circular chromatic numbers and the defective version of these parameters. The main result is that the fractional chromatic number of any series-parallel graph of odd girth k is exactly .
No takes yet. Share an insight, caveat, or question.
Goddard et al. (2015) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: