Elsevier

European Journal of Combinatorics

Volume 40, August 2014, Pages 116-123
European Journal of Combinatorics

How to personalize the vertices of a graph?

https://doi.org/10.1016/j.ejc.2014.02.008Get rights and content
Under an Elsevier user license
open archive

Abstract

If f is a proper coloring of edges in a graph G=(V,E), then for each vertex vV it defines the palette of colors of v, i.e., the set of colors of edges incident with v. In 1997, Burris and Schelp stated the following problem: how many colors do we have to use if we want to distinguish all vertices by their palettes. In general, we may need much more colors than χ(G).

In this paper we show that if we distinguish the vertices by color walks emanating from them, not just by their palettes, then the number of colors we need is very close to the chromatic index. Actually, not greater than Δ(G)+1.

Cited by (0)

The research was partially supported by the Polish Ministry of Science and Higher Education.

1

Tel.: +48 504 276 888.