On the Circular Chromatic Number of Circular Partitionable Graphs

International audienceThis paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs Ghas Xc (G) = X (G). A consequence of this result is that we obtain an infinite family of graphs G with the rare property that the deletion of each vertex decreases its circular chromatic number by exactly

On the Circular Chromatic Number of Circular Partitionable Graphs

This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs Ghas Xc (G) = X (G). A consequence of this result is that we obtain an infinite family of graphs G with the rare property that the deletion of each vertex decreases its circular chromatic number by exactly