Planar graph characterization of γ - Uniquely colorable graphs
M. Yamuna, A. Elakkiya · IOP Conference Series Materials Science and Engineering · 2017
A graph G = ( V, E ) is uniquely colorable if the chromatic number χ ( G ) = n and every n – coloring of G induces the same partition of V. Uniquely colorable graphs whose chromatic partition contains at least one γ - set is γ - uniquely colorable graphs In this paper, we characterize the planarity of γ - uniquely colorable graphs.