Calculating an upper bound of the locating-chromatic number of trees

DOI10.1016/J.TCS.2019.04.011zbMath1442.05170OpenAlexW2945919007WikidataQ127830227 ScholiaQ127830227MaRDI QIDQ2285138

Dian Kastika Syofyan, Edy Tri Baskoro, Hilda Assiyatun

Publication date: 16 January 2020

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

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

zbMATH Keywords

treeupper boundgraph algorithmlocating-chromatic number

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The locating chromatic number for m-shadow of a connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Calculating an upper bound of the locating-chromatic number of trees