On vertex coloring without monochromatic triangles

Michał Karpiński, Krzysztof Piecuch

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. W…