Pages that link to "Item:Q2285138"
From MaRDI portal
The following pages link to Calculating an upper bound of the locating-chromatic number of trees (Q2285138):
Displaying 5 items.
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- Improved algorithm for the locating-chromatic number of trees (Q2219068) (← links)
- The locating chromatic number for m-shadow of a connected graph (Q5054056) (← links)
- On locating and neighbor-locating colorings of sparse graphs (Q6611083) (← links)
- On ( <i>k</i> , <i>ℓ</i> )-locating colorings of graphs (Q6648811) (← links)