Locally identifying coloring of graphs
From MaRDI portal
Publication:456289
zbMath1252.05061arXiv1010.5624MaRDI QIDQ456289
Louis Esperet, Aline Parreau, Pascal Ochem, Sylvain Gravier, Mickaël Montassier
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5624
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (9)
Inapproximability of the lid-chromatic number ⋮ Relaxed locally identifying coloring of graphs ⋮ A Vizing-like theorem for union vertex-distinguishing edge coloring ⋮ Locally identifying coloring of graphs with few P4s ⋮ New bounds and constructions for neighbor-locating colorings of graphs ⋮ On locally identifying coloring of graphs ⋮ Locally identifying coloring in bounded expansion classes of graphs ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Locating-Domination and Identification
This page was built for publication: Locally identifying coloring of graphs
