Pages that link to "Item:Q5177026"
From MaRDI portal
The following pages link to Characterizing all trees with locating-chromatic number 3 (Q5177026):
Displaying 11 items.
- On the locating chromatic number of certain barbell graphs (Q1728997) (← links)
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- Improved algorithm for the locating-chromatic number of trees (Q2219068) (← links)
- Calculating an upper bound of the locating-chromatic number of trees (Q2285138) (← links)
- On locating chromatic number of Möbius ladder graphs (Q5027742) (← links)
- The locating chromatic number for m-shadow of a connected graph (Q5054056) (← links)
- On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph (Q5142014) (← links)
- The dominating partition dimension and locating-chromatic number of graphs (Q6090326) (← links)
- On the comparison of the distinguishing coloring and the locating coloring of graphs (Q6095325) (← links)
- Edge-locating coloring of graphs (Q6571562) (← links)
- On locating and neighbor-locating colorings of sparse graphs (Q6611083) (← links)
