In this thesis we consider colorings of steiner systems and in which blocks have prescribed color patterns. The main question studied is, given an integer , does there exist a coloring of given type using at least, exactly, or at most colors? For several types of colorings, a complete answer to this question is obtained. While for other types, partial results are presented. It is obvious that there exist seven possible type of colorings of steiner triple systems. The coloring of types ,, are trivial. In this thesis we consider colorings of types and for steiner triple systems and we give most of the obtained results on these types of coloring. For Lorenzo Milazzo and Zsolt Tuza proved that there exists a steiner triple system of order with upper chromatic number at most . The bound was the best possibl, type , type , type , and type. Since there are thirty one distinct nonempty subsets of , there are thirty one distinct possible types of colorings of steiner systems . We deal with some of these types. As in the case of steiner triple sysrems let and . In a -