Three-colourability of planar graphs with no 5- or triangular {3,6}-cycles

Steinberg's conjecture asserts that every planar graph without 4- and 5-cycles is 3-colourable. In this paper, we prove that planar graphs without 5-cycles and without triangles adjacent to 3- and 6-cycles are 3-colourable.