Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. - Chuanni Zhang; Yingqian Wang 001; Min Chen 012 (Discret. Math., 2016)

Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. - Zhengke Miao; Yingqian Wang 001; Chuanni Zhang; Huajun Zhang (Discret. Math., 2018)