scientific article; zbMATH DE number 1869706
From MaRDI portal
zbMath1009.05056MaRDI QIDQ4794375
Michael A. Henning, Gary Chartrand, Ping Zhang, David Erwin, Peter J. Slater
Publication date: 11 April 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The locating chromatic number for m-shadow of a connected graph, CERTAIN OPERATION OF GENERALIZED PETERSEN GRAPHS HAVING LOCATING-CHROMATIC NUMBER FIVE, A survey on enhanced power graphs of finite groups, Unnamed Item, On the conjectures of neighbor locating coloring of graphs, The dominating partition dimension and locating-chromatic number 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, Graphs of order \(n\) with locating-chromatic number \(n-1\), Locally identifying colourings for graphs with given maximum degree, Locally identifying coloring in bounded expansion classes of graphs, Improved algorithm for the locating-chromatic number of trees, On the locating chromatic number of certain barbell graphs, Upper bounds on the locating chromatic number of trees, Neighbor-locating colorings in graphs, Calculating an upper bound of the locating-chromatic number of trees, 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
