A Bound for the Locating Chromatic Numbers of Trees

DOI10.22108/toc.2015.6024zbMath1463.05153arXiv1308.5437MaRDI QIDQ5134325

M. Anbarloei, Ali Behtoei

Publication date: 16 November 2020

Full work available at URL: https://arxiv.org/abs/1308.5437

zbMATH Keywords

treemaximum degreelocating chromatic numberlocating coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (4)

On the conjectures of neighbor 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

Cites Work

• On the locating chromatic number of Kneser graphs
• Graphs of order \(n\) with locating-chromatic number \(n-1\)
• The partition dimension of a graph
• On the Locating Chromatic Number of the Cartesian Product of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Bound for the Locating Chromatic Numbers of Trees