Journal of Graph Theory · 2015 · 13 citations · 12 references
Natural SciencesMathematicsCombinatoricsCombinatorial Number TheoryGraph AlgorithmsGraph ColoringGraph TheoryChromatic PolynomialsCircular ColoringColoring TheoremsFractional Coloring
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 .
12
Xuding Zhu · Discrete Mathematics · 2001 · 321 citations
Andrew Vince · Journal of Graph Theory · 1988 · 265 citations