Pages that link to "Item:Q2219068"
From MaRDI portal
The following pages link to Improved algorithm for the locating-chromatic number of trees (Q2219068):
Displaying 8 items.
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- Calculating an upper bound of the locating-chromatic number of trees (Q2285138) (← links)
- The locating chromatic number for m-shadow of a connected graph (Q5054056) (← links)
- A survey on enhanced power graphs of finite groups (Q5081208) (← links)
- On the comparison of the distinguishing coloring and the locating coloring of graphs (Q6095325) (← links)
- On locating and neighbor-locating colorings of sparse graphs (Q6611083) (← links)
- On ( <i>k</i> , <i>ℓ</i> )-locating colorings of graphs (Q6648811) (← links)
- Partition dimension of trees -- palm approach (Q6669818) (← links)