1. Coloring powers of planar graphs;Agnarsson;SIAM J Discrete Math,2003
2. M. Bonamy D. W. Cranston L. Postle Planar graphs of girth at least five are square ( Δ + 2 ) -choosable https://arxiv.org/abs/1508.03663
3. Stars and bunches in planar graphs, Part I: Triangulations;Borodin;Original Russian version. Diskretn. Anal. Issled. Oper. Ser,2001
4. Stars and bunches in planar graphs, Part II: General planar graphs and colourings;Borodin;Original Russian version. Diskretn. Anal. Issled. Oper. Ser,2001
5. A sufficient condition for a planar graph to be 2-distant (Δ+1)-colorable;Borodin;Sib. Elektron. Math. Izv,2004