Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete

From MaRDI portal
Publication:730005

DOI10.1016/j.tcs.2016.10.011zbMath1355.68106arXiv1407.7423OpenAlexW2542720522MaRDI QIDQ730005

Michał Karpiński

Publication date: 23 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7423




Related Items (3)




Cites Work




This page was built for publication: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete