• Amini O, Esperet L, van den Heuvel J (2013) A unified approach to distance-two colouring of graphs on surfaces. Combinatorica 33(3):253–296

  Article MathSciNet  Google Scholar 

• Bonamy M, Lévêque B, Pinlou A (2014) Graphs with maximum degree\(\varDelta \ge 17\) and maximum average degree less than 3 are list 2-distance\((\varDelta + 2)\)-colorable. Discrete Math 317:19–32

  Article MathSciNet  Google Scholar 

• Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London

  Book  Google Scholar 

• Borodin OV (1989) On the total coloring of planar graphs. J Reine Angew Math 394:180–185

  MathSciNet MATH  Google Scholar 

• Borodin OV, Ivanova AO (2009) List 2-distance\(\varDelta +2\)-coloring of planar graphs with girth 6 and\(\varDelta \ge 24\). Sib Math J 50(6):958–964

  Article MathSciNet  Google Scholar 

• Borodin OV, Broersma HJ, Glebov A, van den Heuvel J (2002) Stars and bunches in planar graphs. Part: general planar graphs and colorings. Technical Report, London School of Economics

• Borodin OV, Glebov AN, Ivanova AO, Neustroeva TK, Tashkinov VA (2004) Sufficient conditions for the 2-distance\((\varDelta +1)\)-colorability of plane graphs. Sib Elektron Mat Izv 1:129–141 (in Russian)

  MATH  Google Scholar 

• Borodin OV, Ivanova AO, Neustroeva TK (2006) List\((p, q)\)-coloring of sparse planar graphs. Sib Elektron Mat Izv 3:355–361 (in Russian)

  MathSciNet MATH  Google Scholar 

• Cranston D, Jaeger B (2017) List-coloring the squares of planar graphs without 4-cycles and 5-cycles. J Graph Theory 85(4):721–737

  Article MathSciNet  Google Scholar 

• Dvořák Z, Král D, Nejedlý P, Sǩrekovski R (2008) Coloring squares of planar graphs with girth six. Eur J Combin 29:838–849

  Article MathSciNet  Google Scholar 

• Griggs JR, Král D (2009) Graph labellings with variable weights, a survey. Discrete Appl Math 157:2646–2658

  Article MathSciNet  Google Scholar 

• Havet F (2009) Choosability of the square of planar subcubic graphs with large girth. Discrete Math 309:3553–3563

  Article MathSciNet  Google Scholar 

• Havet F, van den Heuvel J, McDiarmid C, Reed B (2007) List colouring squares of planar graphs. Electron Notes Discrete Math 29:515–519

  Article  Google Scholar 

• Ivanova AO (2011) List 2-distance\((\varDelta +1)\)-coloring of planar graphs with girth at least 7. J Appl Ind Math 5(2):130–221

  Article MathSciNet  Google Scholar 

• Kostochka AV, Woodall DR (2001) Choosability conjectures and multicircuits. Discrete Math 240:123–143

  Article MathSciNet  Google Scholar 

• Kramer F, Kramer H (2008) A survey on the distance-colouring of graphs. Discrete Math 308:422–426

  Article MathSciNet  Google Scholar 

• Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J Combin Theory Ser B 94:189–213

  Article MathSciNet  Google Scholar 

• van den Heuvel J, McGuinness S (2003) Coloring of the square of a planar graph. J Graph Theory 42:110–124

  Article MathSciNet  Google Scholar 

• Wegner G (1977) Graphs with given diameter and coloring problem. Technical Report, University of Dortmund

• Zhu HY, Lu XZ, Wang CQ, Chen M (2012) Labelling planar graphs without 4,5-cycles with a condition on distance two. SIAM J Discrete Math 26:52–64

  Article MathSciNet  Google Scholar 

• Zhu HY, Hou LF, C W, LU XZ (2014) The\(L(p, q)\)-labelling of planar graphs without 4-cycles. J Discrete Appl Math 162:355–363

  Article MathSciNet  Google Scholar 

Download references