Improved algorithm for the locating-chromatic number of trees
From MaRDI portal
Recommendations
Cites work
- Characterizing all trees with locating-chromatic number 3
- scientific article; zbMATH DE number 3494441 (Why is no real title available?)
- scientific article; zbMATH DE number 3544092 (Why is no real title available?)
- scientific article; zbMATH DE number 1869706 (Why is no real title available?)
- On locating-chromatic number of complete \(n\)-ary tree
- On the locating-chromatic number of homogeneous lobsters
- The locating-chromatic number of firecracker graphs
- Upper bounds on the locating chromatic number of trees
Cited in
(9)- Upper bounds on the locating chromatic number of trees
- Calculating an upper bound of the locating-chromatic number of trees
- The locating chromatic number for m-shadow of a connected graph
- On the locating chromatic number of trees
- A survey on enhanced power graphs of finite groups
- On the comparison of the distinguishing coloring and the locating coloring of graphs
- On locating and neighbor-locating colorings of sparse graphs
- On ( k , ℓ )-locating colorings of graphs
- Partition dimension of trees -- palm approach
This page was built for publication: Improved algorithm for the locating-chromatic number of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219068)