Graphs of order \(n\) with locating-chromatic number \(n-1\)
From MaRDI portal
Publication:1402068
DOI10.1016/S0012-365X(02)00829-4zbMath1020.05026OpenAlexW1998852025MaRDI QIDQ1402068
David Erwin, Gary Chartrand, Ping Zhang, Peter J. Slater, Michael A. Henning
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00829-4
Related Items
The locating chromatic number for m-shadow of a connected graph, CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE, On the conjectures of neighbor locating coloring of graphs, On the comparison of the distinguishing coloring and the locating coloring of graphs, New bounds and constructions for neighbor-locating colorings of graphs, On the locating chromatic number of certain barbell graphs, Neighbor-locating colorings in graphs, Neighbor-locating coloring: graph operations and extremal cardinalities, A Bound for the Locating Chromatic Numbers of Trees, Locating-Domination and Identification, On the locating chromatic number of Kneser graphs, Locating chromatic number of powers of paths and cycles, On locating chromatic number of Möbius ladder graphs
Cites Work
