• Borodin OV (1987) Coupled colorings of graphs on a plane. Metod Diskret Anal 45:21–27 (in Russian)

  MathSciNet MATH  Google Scholar 

• Borodin OV (1993) Simultaneous coloring of edge neighborhoods in planar graphs and the simultaneous coloring of vertices, edges and faces. Mat Zamet 53:35–47 (in Russian)

  MATH  Google Scholar 

• Borodin OV (1994) Simultaneous coloring of edges and faces of plane graphs. Discret Math 128:21–33

  Article MathSciNet MATH  Google Scholar 

• Borodin OV (1995) A new proof of the 6 colour theorem. J Graph Theory 19:507–521

  Article MathSciNet MATH  Google Scholar 

• Borodin OV (1996) Structural theorm on plane graphs with application to the entire coloring number. J Graph Theory 23:233–239

  Article MathSciNet MATH  Google Scholar 

• Borodin OV (2013) Colorings of plane graphs: a survey. Discret Math 313:517–539

  Article MathSciNet MATH  Google Scholar 

• Dong W (2012) A note on entire choosability of plane graphs. Discret Appl Math 160:1257–1261

  Article MathSciNet MATH  Google Scholar 

• Hetherington TJ (2009) Entire choosablity of near-outerplane graphs. Discret Math 309:2153–2165

  Article MathSciNet MATH  Google Scholar 

• Hu X, Wang W, Wang Y (2014) The edge-face choosability of plane graphs with maximum degree at least 9. Discret Math 327:1–8

  Article MathSciNet MATH  Google Scholar 

• Hu X, Wang Y (2014) Plane graphs are entirely\((\Delta +5)\)-choosable. Discret Math Algorithms Appl 6(2):1450023 9 pp.

  Article MathSciNet MATH  Google Scholar 

• Kronk HV, Mitchem J (1972) The entire chromatic number of a normal graph is at most seven. Bull Am Math Soc 78:799–800

  Article MathSciNet MATH  Google Scholar 

• Kronk HV, Mitchem J (1973) A seven color theorem on the sphere. Discret Math 5:253–260

  Article MathSciNet MATH  Google Scholar 

• Sanders DP, Zhao Y (2000) On the entire coloring conjecture. Can Math Bull 43:108–114

  Article MathSciNet MATH  Google Scholar 

• Vizing VG (1964) On an estimate of the chromatic index of ap-graph. Diskret Anal 3:25–30

  MathSciNet  Google Scholar 

• Wang W (1995) On the colorings of outerplanar graphs. Discret Math 147:257–269

  Article MathSciNet MATH  Google Scholar 

• Wang W (1999) Upper bounds of entire chromatic number of plane graphs. Eur J Comb 20:313–315

  Article MathSciNet MATH  Google Scholar 

• Wang W, Zhu X (2011) Entire coloring of plane graphs. J Comb Theory Ser B 101:490–501

  Article MATH  Google Scholar 

• Wang Y, Mao X, Miao Z (2013) Plane graphs with maximum degree\(\Delta \ge 8\) are entirely\((\Delta +3)\)-colorable. J Graph Theory 73:305–317

  Article MathSciNet MATH  Google Scholar 

• Wang Y, Hu X, Wang W (2014) Plane graphs with\(\Delta \ge 9\) are entirely\((\Delta +2)\)-colorable. SIAM J Discret Math 28:1892–1905

  Article MATH  Google Scholar 

• Wu J, Wu Y (2005) The entire coloring of series-parallel graphs. Acta Math Appl Sin Engl Ser 21:61–66

  Article MathSciNet MATH  Google Scholar 

• Zhang Z, Wang J, Wang W, Wang L (1993) The complete chromatic number of some planar graphs. Sci China Ser A 36:1169–1177

  MathSciNet MATH  Google Scholar 

Download references