The locating chromatic number of the join of graphs
From MaRDI portal
Publication:274635
zbMath1338.05073arXiv1112.2357MaRDI QIDQ274635
Publication date: 22 April 2016
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.2357
Related Items (9)
The locating chromatic number for m-shadow of a connected graph ⋮ CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE ⋮ 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 ⋮ Unnamed Item ⋮ On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph ⋮ Neighbor-locating colorings in graphs ⋮ Locating-Domination and Identification
This page was built for publication: The locating chromatic number of the join of graphs