Premium
On the circular chromatic number of circular partitionable graphs
Author(s) -
Pêcher Arnaud,
Zhu Xuding
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20164
Subject(s) - mathematics , combinatorics , chromatic scale , vertex (graph theory) , discrete mathematics , graph
This article studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs G has $\chi_ c (G) = \chi(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. © 2006 Wiley Periodicals, Inc. J Graph Theory