Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. - Owen Hill; Diana Smith; Yingqian Wang 001; Lingji Xu; Gexin Yu (Discret. Math., 2013)

A Relaxation of Steinberg's Conjecture. - Owen Hill; Gexin Yu (SIAM J. Discret. Math., 2013)