Characterizing all graphs containing cycles with locating-chromatic number 3
From MaRDI portal
Publication:5107896
DOI10.1063/1.4724167zbMath1433.05110OpenAlexW2047249813MaRDI QIDQ5107896
Publication date: 29 April 2020
Published in: AIP Conference Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.4724167
Related Items (3)
The dominating partition dimension and locating-chromatic number of graphs ⋮ On the comparison of the distinguishing coloring and the locating coloring of graphs ⋮ On locating chromatic number of Möbius ladder graphs
This page was built for publication: Characterizing all graphs containing cycles with locating-chromatic number 3