Skip to Main content Skip to Navigation
Journal articles

The b-chromatic number of powers of cycles

Abstract : A b-coloring of a graph G by k colors is a proper vertex coloring such that each color class contains a color-dominating vertex, that is, a vertex having neighbors in all other k-1 color classes. The b-chromatic number χb(G) is the maximum integer k for which G has a b-coloring by k colors. Let Cnr be the rth power of a cycle of order n. In 2003, Effantin and Kheddouci established the b-chromatic number χb(Cnr) for all values of n and r, except for 2r+3≤n≤3r. For the missing cases they presented the lower bound L:= min n-r-1,r+1+⌊ n-r-1 / 3⌋ and conjectured that χb(Cnr)=L. In this paper, we determine the exact value on χb(Cnr) for the missing cases. It turns out that χb(Cnr)>L for 2r+3≤n≤2r+3+r-6 / 4.
Document type :
Journal articles
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990613
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 4:29:02 PM
Last modification on : Thursday, September 7, 2017 - 1:03:47 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:47:59 PM

File

1856-7797-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990613, version 1

Collections

Citation

Anja Kohl. The b-chromatic number of powers of cycles. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 1 (1), pp.147--156. ⟨hal-00990613⟩

Share

Metrics

Record views

262

Files downloads

1440