Algorithm for optimal coloring of square $(0,1)$-matrices

The paper proposes an algorithm for solving the configuration-optimization coloring problem for square $(0,1)$-matrices, which is based on the method of selection their structural features. The algorithm belongs to the method's of backtracking, however, the construction of the optimal solution is carried out among the options that provide a certain configuration, due to which the size of the search tree is significantly reduced. A detailed scheme of its operation is given, and the effectiveness of the solution is demonstrated by the example of calculating the chromatic number of a specific $(0,1)$-matrix.