γ - Uniquely colorable graphs

G, G ̅ Properties – from G ̅, G

“…In Figure 8 G, are planar, G is just excellent. Contracting (4, 5), (6,3), (7,2), we see that 1, 63, 45, 72, 8 is K 5 and hence is non planar. If G is just excellent graph …”

“…Yamuna et al introduced Non domination subdivision stable graphs (NDSS) and characterized planarity of complement of NDSS graphs.. In [6], [7], M. Yamuna et al introduced uniquely colorable graphs and also provided the constructive characterization of  -uniquely colorable trees and characterized planarity of complement of  -uniquely colorable graphs.This paper targets to determine properties of using properties of G without constructing .…”

A Survey on Characterizing Trees Using Domination Number

“…A graph G is said to be uniquely colorable if at least one set in the chromatic partition is a γ-set. In addition, they provided a constructive characterization of γ-uniquely colorable trees in [67]. Let T 34 be the family of trees such that T 1 is K 1 and T i+1 can be obtained from T i by one of the Operations 109-111 [67].…”

Planar and Non Planar Construction of - Uniquely Colorable Graph

“…In [1] Bing Zhou investigated the dominating --color number, d  (G) , of a graph G. In [2], [3], M. Yamuna et al introduced uniquely colorable graphs and also provided the constructive characterization of  -uniquely colorable trees and characterized planarity of complement of  -uniquely colorable graphs. In [4], [5],M.…”