Yaroslav Shitov. A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length. Theoretical Computer Science, 674:116-118, 2017. [doi]
@article{Shitov17a,
title = {A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length},
author = {Yaroslav Shitov},
year = {2017},
doi = {10.1016/j.tcs.2017.02.005},
url = {https://doi.org/10.1016/j.tcs.2017.02.005},
researchr = {https://researchr.org/publication/Shitov17a},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {674},
pages = {116-118},
}