Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Abstract is missing.