Improved algorithm for the locating-chromatic number of trees

DOI10.1016/j.tcs.2020.12.037zbMath1479.05092OpenAlexW3113424982MaRDI QIDQ2219068

Devi Imulia Dian Primaskun, Edy Tri Baskoro

Publication date: 19 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.037

zbMATH Keywords

treealgorithmpalmlocating-chromatic number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The locating chromatic number for m-shadow of a connected graph ⋮ A survey on enhanced power graphs of finite groups ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs

Cites Work

• Upper bounds on the locating chromatic number of trees
• On the locating-chromatic number of homogeneous lobsters
• On locating-chromatic number of complete \(n\)-ary tree
• Characterizing all trees with locating-chromatic number 3
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved algorithm for the locating-chromatic number of trees