On Vertex Coloring Without Monochromatic Triangles
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. We give the first classification of the problem in terms of classic and parametrized algorithms. Several computational complexity results are also presented, which improve on the previous results found in the literature. We propose the new structural parameter for undirected, simple graphs – the triangle-free chromatic number \(\chi _3\). We bound \(\chi _3\) by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observations about our problem.
- 6.Deb R.: An efficient nonparametric test of the collective household model (2008). SSRN: http://ssrn.com/abstract=1107246
- 7.Dinur, I., Regev, O., Smyth, C.: The hardness of 3-uniform hypergraph coloring. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 33–40 (2002)Google Scholar
- 11.Jain, P.: On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem. Pre-print: arXiv:1003.3704 [cs.CC] (2010)
- 14.Karpiński, M., Piecuch, K.: On vertex coloring without monochromatic triangles. Pre-print, arXiv:1710.07132 [cs.DS] (2017)
- 17.Schaefer, T.J.: The complexity of satisfiability problems. In: STOC 1978, pp. 216–226 (1978)Google Scholar