Frieze, Alan Pegden, Wesley Between 2- and 3-colorability <p>We consider the question of the existence of homomorphisms between Gn,p and odd cycles when p=c/n, 1</p> 3-colorability;Polynomial-time algorithm;Hereditary class of graphs;Computational complexity 2014-09-30
    https://kilthub.cmu.edu/articles/journal_contribution/Between_2-_and_3-colorability/6476960
10.1184/R1/6476960.v1