3-consecutive C-colorings of graphs
Csilla Bujtás, Charles Dominic, E. Sampathkumar, M.S. Subramanya, Źsolt Tuza · Discussiones Mathematicae Graph Theory · 2010
A 3-consecutive C-coloring of a graph G = (V;E) is a mapping ’ : V !N such that every path on three vertices has at most two colors. We prove general estimates on the maximum number „ ´3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with „ ´3CC(G) ‚ k for k = 3 and k = 4.