New estimates for the gap chromatic number

The gap chromatic number, gap ( G ) , is a graph colouring parameter introduced by M.A. Tahraoui, E. Duchêne, and H. Kheddouci in Tahraoui et al. (2012). From an edge labelling f : E → { 1 , … , k } of a graph G = ( V , E ) on n vertices, an induced vertex colouring l is constructed by colouring vertices of degree greater than one by the difference between their maximum and their minimum incident edge labels. Vertices of degree one get their incident edge label as colour. The gap chromatic number gap ( G ) is the minimum k , for which a labelling f of G exists such that l is injective. It is conjectured in Tahraoui et al. (2012) that, for all graphs without isolated edges or vertices (connected or not), gap ( G ) ≤ n + 1 , but the only general bound proved is 2 | E | − 1 . ve the conjecture for connected graphs and disprove it in general by exhibiting a class of graphs with gap colouring number n + 2 . For graphs without isolated edges or vertices, we prove the bound gap ( G ) ≤ n + 9 .