On the Circular Chromatic Number of Circular Partitionable Graphs

Arnaud Pêcher (1, 2) , Xuding Zhu (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
3 Department of Applied Mathematics [Kaohsiung]

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 1

Domaines: Autre [cs.OH]

Arnaud Pêcher, Xuding Zhu. On the Circular Chromatic Number of Circular Partitionable Graphs. Journal of Graph Theory, 2006, 52, pp.294--306. ⟨hal-00307764⟩