The following pages link to (Q4794375):
Displayed 22 items.
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- On the locating chromatic number of Kneser graphs (Q765319) (← links)
- Graphs of order \(n\) with locating-chromatic number \(n-1\) (Q1402068) (← links)
- On the locating chromatic number of certain barbell graphs (Q1728997) (← links)
- Upper bounds on the locating chromatic number of trees (Q1730257) (← links)
- Neighbor-locating coloring: graph operations and extremal cardinalities (Q1792080) (← links)
- Improved algorithm for the locating-chromatic number of trees (Q2219068) (← links)
- Neighbor-locating colorings in graphs (Q2285128) (← links)
- Calculating an upper bound of the locating-chromatic number of trees (Q2285138) (← links)
- Locating chromatic number of powers of paths and cycles (Q2335071) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- On the conjectures of neighbor locating coloring of graphs (Q2672594) (← links)
- Locating-Domination and Identification (Q3384611) (← 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)
- CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE (Q5075651) (← links)
- A survey on enhanced power graphs of finite groups (Q5081208) (← links)
- A Bound for the Locating Chromatic Numbers of Trees (Q5134325) (← links)
- (Q5228101) (← 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)
- New bounds and constructions for neighbor-locating colorings of graphs (Q6132528) (← links)