Bounds on Graceful <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e1852" altimg="si17.svg"><mml:mi>k</mml:mi></mml:math>-colorings of graphs

We investigate the graceful k -coloring introduced by Gary Chartrand in 2015. The graceful k -coloring of a graph G consists of a proper vertex coloring π : V ( G ) → { 1 , 2 , … , k } , k ≥ 1 , that induces a proper edge coloring π ′ : E ( G ) → { 1 , 2 , … , k − 1 } defined by π ′ ( u v ) = | π ( u ) − π ( v ) | , where u v ∈ E ( G ) . The smallest positive integer k for which a graph G has a graceful k -coloring is called the graceful chromatic number of G and is denoted by χ g ( G ) . In this paper, we improve a previous upper bound for the graceful chromatic number of an arbitrary graph, showing that χ g ( G ) ≤ 2 Δ 2 − Δ + 1 , where Δ is the maximum degree of the graph G . This also implies an improvement over the first bound given for complete graphs. Moreover, we study this problem within the context of cubic graph classes, determining the exact value of the graceful chromatic number of each member of the infinite families of the Generalized Blanuša and the Loupekine snarks.