Pages that link to "Item:Q2285138"

The following pages link to Calculating an upper bound of the locating-chromatic number of trees (Q2285138):

Displaying 3 items.

• 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)