On one problem in the graph theory

The problem of the graph chromatic number is studied in its relation with minimization of the number of computer memory cells and automatic classification. A grammar is developed that generates all flat triangulations with a chromatic number not exceeding four.