On the Locating Chromatic Number of the Cartesian Product of Graphs
From MaRDI portal
Publication:2828993
zbMath1413.05100arXiv1106.3453MaRDI QIDQ2828993
Publication date: 26 October 2016
Full work available at URL: https://arxiv.org/abs/1106.3453
Related Items
The locating chromatic number for m-shadow of a connected graph, On the conjectures of neighbor locating coloring of graphs, On the comparison of the distinguishing coloring and the locating coloring of graphs, New bounds and constructions for neighbor-locating colorings of graphs, On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph, Neighbor-locating colorings in graphs, A Bound for the Locating Chromatic Numbers of Trees, On locating chromatic number of Möbius ladder graphs