Chromatic Excellence in Graphs
Kulrekha Mudartha, R. Sundareswaran, V. Swaminathan · Mapana Journal of Sciences · 2011
Excellence in graphs introduced by G.H. Fricke is extended to partitions of the vertex set with respect to a parameter. A graph G is said to be Chromatic excellent if {v} appears in a chromatic partition of G for every vϵV(G). This paper is devoted to the study of chromatic excellence in graphs.