In given graph G=(V,E), set of vertices S with an assignment of colors to them is a defining set of vertex coloring of G if there is a unique extension of the colors of S to a chromatic coloring to G. In this paper we discuss on the two conjectures, so that we disprove one of them and prove the another.
