Characterizing all trees with locating-chromatic number 3

DOI10.5614/ejgta.2013.1.2.4zbMath1306.05050OpenAlexW1975883001MaRDI QIDQ5177026

Asmiati, Edy Tri Baskoro

Publication date: 5 March 2015

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2013.1.2.4

zbMATH Keywords

treeslocating-chromatic number

Mathematics Subject Classification ID

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

Related Items (9)

The locating chromatic number for m-shadow of a connected graph ⋮ The dominating partition dimension and locating-chromatic number of graphs ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ Improved algorithm for the locating-chromatic number of trees ⋮ On the locating chromatic number of certain barbell graphs ⋮ Upper bounds on the locating chromatic number of trees ⋮ On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph ⋮ Calculating an upper bound of the locating-chromatic number of trees ⋮ On locating chromatic number of Möbius ladder graphs

This page was built for publication: Characterizing all trees with locating-chromatic number 3