A local k-coloring of a graph G is a function f: V (G)→{1, 2,⋯, k} such that for each S⊆ V (G),
2≤| S|≤ 3, there exist u, v∈ S with| f (u)− f (v)| at least the size of the subgraph induced by …

A local coloring of a graph G is a function c: V (G)→ N having the property that for each set
S⊆ V (G) with 2≤| S|≤ 3, there exist vertices u, v∈ S such that| c (u)− c (v)|≥ mS, where …

A local k-coloring of a graph G is a function f: V (G)→{1, 2,⋯, k} such that for each S⊆ V (G),
2≤| S|≤ 3, there exist u, v∈ S with| f (u)− f (v)| at least the size of the subgraph induced by …

A local colouring of a graph G is a function c: V (G)→ ℕ such that for each S⊆ V (G), 2≤|
S|≤ 3, there exist u, v∈ S with| c (u)− c (v)| at least the number of edges in the subgraph …

The k-Local Colouring of Jahangir Graphs and Some Characteristics of the k-Locally Rain- bow
Graphs Page 1 Mapana J Sci, 15, 3 (2016), 25–33 ISSN 0975-3303 | https://doi.org …

A local coloring of a graph G is a function c: V (G)→ N having the property that for each set
S⊆ V (G) with 2≤| S|≤ 3, there exist vertices u, v∈ S such that the colors of u and v differ by …