Vertex 2-coloring without monochromatic cycles
Computational Complexity
2014-07-29 v1 Data Structures and Algorithms
Abstract
In this paper we study a problem of vertex two-coloring of undirected graph such that there is no monochromatic cycle of given length. We show that this problem is hard to solve. We give a proof by presenting a reduction from variation of satisfiability (SAT) problem. We show nice properties of coloring cliques with two colors which plays pivotal role in the reduction construction.
Keywords
Cite
@article{arxiv.1407.7423,
title = {Vertex 2-coloring without monochromatic cycles},
author = {Michał Karpiński},
journal= {arXiv preprint arXiv:1407.7423},
year = {2014}
}