Graphs of order n with locating-chromatic number n - 1

Discrete Mathematics

Volumn 269, Issue 1-3, 2003, Pages 65-79

  Chartrand, Gary ^a   Erwin, David ^b   Henning, Michael A ^c   Slater, Peter J ^d   Zhang, Ping ^a  

^a WESTERN MICHIGAN UNIVERSITY   (United States)

^b TRINITY COLLEGE   (United States)

^c UNIVERSITY OF KWAZULU NATAL   (South Africa)

^d University of Alabama in Huntsville ^*  (United States)

Author keywords

Locating set; Locating chromatic number; Locating coloring

Indexed keywords

SET THEORY;

CHROMATIC NUMBER;

GRAPH THEORY;

EID: 0038141236     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00829-4     Document Type: Article

References (4)

1. Chartrand G., Erwin D., Henning M.A., Slater P.J., Zhang P. The locating-chromatic number of a graph. Bull. Inst. Combin. Appl. 36:2002;89-101.
2. Harary F., Melter R.A. On the metric dimension of a graph. Ars Combin. 2:1976;191-195.
3. Slater P.J. Leaves of trees. Congr. Numer. 14:1975;549-559.
4. Slater P.J. Dominating and reference sets in graphs. J. Math. Phys. Sci. 22:1988;445-455.