Hamiltonicity of Total Domination 3-Connected Edge Critical Graph.
Roland Forson · SSRN Electronic Journal · 2017
A graph G is color critical if for every proper sub-graph H of G. A k-critical graph is one that is k-chromatic and critical. Suppose for every vertex with degree at most, if G is k-critical then and is.