\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
A graph is called weakly perfect if its chromatic number equals its clique
number. In this paper a new class of weakly perfect graphs arising from
rings are presented and an explicit formula for the chromatic number of
such graphs is given.
\end{document}