Arcs-Art

The following art is a product of the study. Own a piece of art generated by solving mathematical problems Colorful, unique by shape and color, 1024 graphic elements on each of 1024 items. Abstract: The word problem for products of symmetric groups, the circular arc graph coloring problem, and the circle graph coloring problem, as well as several related problems, are proved to be NP-complete. For any fixed number K of colors. the problem of determining whether a given circular arc graph is K-colorable is shown to be solvable in polynomial time.