Locally identifying colourings for graphs with given maximum degree

Citations of this article
Mendeley users who have this article in their library.


A proper vertex-colouring of a graph G is said to be locally identifying if for any pair u, v of adjacent vertices with distinct closed neighbourhoods, the sets of colours in the closed neighbourhoods of u and v are different. We show that any graph G has a locally identifying colouring with 2Δ 2- 3Δ+3 colours, where Δ is the maximum degree of G, answering in a positive way a question asked by Esperet et al. We also provide similar results for locally identifying colourings which have the property that the colours in the neighbourhood of each vertex are all different and apply our method to the class of chordal graphs. © 2012 Elsevier B.V. All rights reserved.




Foucaud, F., Honkala, I., Laihonen, T., Parreau, A., & Perarnau, G. (2012). Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics, 312(10), 1832–1837. https://doi.org/10.1016/j.disc.2012.01.034

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free