A characterization of uniquely vertex colorable graphs using minimal defining sets

A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal defining set to be a defining set which does not properly contain another defining set. If G is a uniquely vertex

• Type: Journal
• Year: 1999
• Where: DM
• Authors: Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
• Keywords: DM 1999, Unique Completion