Pages that link to "Item:Q2828993"
From MaRDI portal
The following pages link to On the locating chromatic number of the Cartesian product of graphs. (Q2828993):
Displaying 14 items.
- On the locating chromatic number of Kneser graphs (Q765319) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- Neighbor-locating coloring: graph operations and extremal cardinalities (Q1792080) (← links)
- Neighbor-locating colorings in graphs (Q2285128) (← links)
- On the conjectures of neighbor locating coloring of graphs (Q2672594) (← 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)
- A Bound for the Locating Chromatic Numbers of Trees (Q5134325) (← links)
- On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph (Q5142014) (← 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)
- Neighbor locating coloring on graphs: three products (Q6625080) (← links)
- On ( <i>k</i> , <i>ℓ</i> )-locating colorings of graphs (Q6648811) (← links)
