On the conjectures of neighbor locating coloring of graphs
From MaRDI portal
Publication:2672594
DOI10.1016/j.tcs.2022.04.031OpenAlexW4224992181WikidataQ123338719 ScholiaQ123338719MaRDI QIDQ2672594
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.031
Related Items
Cites Work
- Unnamed Item
- The locating chromatic number of the join of graphs
- On the locating chromatic number of Kneser graphs
- Graphs of order \(n\) with locating-chromatic number \(n-1\)
- Neighbor-locating coloring: graph operations and extremal cardinalities
- Neighbor-locating colorings in graphs
- On the Locating Chromatic Number of the Cartesian Product of Graphs
- The locating-chromatic number for Halin graphs
- A Bound for the Locating Chromatic Numbers of Trees