Planar graphs without adjacent cycles of length at most seven are 3-colorable

We prove that every planar graph in which no ii-cycle is adjacent to a jj-cycle whenever 3≤i≤j≤73≤i≤j≤7 is 3-colorable and pose some related problems on the 3-colorability of planar graphs.