$k$-Saturated Graphs of Chromatic Number at Least $k$

Abstract

In this paper, we consider the structure of $k$-saturated graphs $(G\not\supset K_k,$ but $G+e\supset K_k$ for all possible edges $$\begin{gathered} e) \\ )havingchromaticnumberatleast\text{(}k \end{gathered}$$.