This paper deals with the coloring of polyhedrons. The famous four-color theorem comes into effect for polyhedrons as well as the 2-dimensional maps. However, the more the faces of polyhedrons the more complicated, and it becomes almost impossible to solve the four-color problem. A systematic procedure or an algorithm is needed for this problem. Our proposals on the problem are applied to the regular polyhedrons and delta polyhedrons.