Upper bounds on the locating chromatic number of trees

DOI10.1016/j.dam.2018.10.034zbMath1441.05074OpenAlexW2901553152WikidataQ128942867 ScholiaQ128942867MaRDI QIDQ1730257

Naoki Matsumoto, Michitaka Furuya

Publication date: 11 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.034

zbMATH Keywords

treelocating chromatic numberdistinguishing chromatic number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The locating chromatic number for m-shadow of a connected graph ⋮ Improved algorithm for the locating-chromatic number of trees ⋮ Calculating an upper bound of the locating-chromatic number of trees

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
• The distinguishing chromatic number
• Graphs with large distinguishing chromatic number
• The distinguishing chromatic number of Kneser graphs
• Distinguishing chromatic numbers of bipartite graphs
• On the locating-chromatic number of homogeneous lobsters
• On locating-chromatic number of complete \(n\)-ary tree
• Distinguishing Chromatic Number of Cartesian Products of Graphs
• Characterizing all trees with locating-chromatic number 3

This page was built for publication: Upper bounds on the locating chromatic number of trees