On 3-colorable planar graphs without prescribed cycles Original Research Article

In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.