A Tight Bound on the Set Chromatic Number

A Tight Bound on the Set Chromatic Number

We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjec...

Full description

Bibliographic Details
Main Authors: Sereni Jean-Sébastien, Yilma Zelealem B.
Format: Article
Language:English
Published: Sciendo 2013-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
chromatic number
set coloring
set chromatic number
neighbor
distinguishing coloring
Online Access:https://doi.org/10.7151/dmgt.1679

Internet

https://doi.org/10.7151/dmgt.1679

Similar Items