Journal of Combinatorial Optimization

, Volume 31, Issue 3, pp 1013–1022 | Cite as

A note on the minimum number of choosability of planar graphs

  • Huijuan Wang
  • Lidong Wu
  • Xin Zhang
  • Weili Wu
  • Bin LiuEmail author


The problem of minimum number of choosability of graphs was first introduced by Vizing. It appears in some practical problems when concerning frequency assignment. In this paper, we study two important list coloring, list edge coloring and list total coloring. We prove that \(\chi '_{l}(G)=\varDelta \) and \(\chi ''_{l}(G)=\varDelta +1\) for planar graphs with \(\varDelta \ge 8\) and without adjacent 4-cycles.


Choosability Planar graph Cycle List edge coloring 



This work was supported in part by the National Natural Science Foundation of China under Grants 11201440, 11271006, 11301410, the Natural Science Basic Research Plan in Shaanxi Province of China under Grant 2013JQ1002, and the Scientific Research Foundation for the Excellent Young and Middle-Aged Scientists of Shandong Province of China under Grant BS2013DX002. This work was also supported in part by the National Science Foundation of USA under Grants CNS-0831579 and CCF-0728851.


  1. Angelini P, Frati F (2012) Acyclically 3-colorable planar graphs. J Comb Optim 24:116–130MathSciNetCrossRefzbMATHGoogle Scholar
  2. Bessy S, Havet F (2013) Enumerating the edge-colourings and total colourings of a regular graph. J Comb Optim 25:523–535MathSciNetCrossRefzbMATHGoogle Scholar
  3. Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Combin Theory Ser B 71:184–204MathSciNetCrossRefzbMATHGoogle Scholar
  4. Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Global Optim 28:115–119MathSciNetCrossRefzbMATHGoogle Scholar
  5. Garg N, Papatriantafilou M, Tsigas P (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. In: Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, pp 18–25. doi: 10.1109/SPDP.1996.570312
  6. Hägkvist R, Chetwynd A (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J Graph Theory 16:503–516MathSciNetCrossRefzbMATHGoogle Scholar
  7. Hou JF, Liu GZ, Cai JS (2006) List edge and list total colorings of planar graphs without 4-cycles. Theoret Comput Sci 369:250–255MathSciNetCrossRefzbMATHGoogle Scholar
  8. Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, NewYorkzbMATHGoogle Scholar
  9. Li R, Xu BG (2011) Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discrete Math 311:2158–2163MathSciNetCrossRefzbMATHGoogle Scholar
  10. Li XW, Mak-Hau V, Zhou SM (2013) The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups. J Comb Optim 25:716–736MathSciNetCrossRefzbMATHGoogle Scholar
  11. Liu B, Hou JF, Wu JL, Liu GZ (2009) Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Math 309:6035–6043MathSciNetCrossRefzbMATHGoogle Scholar
  12. Vizing VG (1976) Vertex colorings with given colors. Metody Diskret Analiz (in Russian) 29:3–10MathSciNetGoogle Scholar
  13. Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014a) Minimum total coloring of planar graph. J Glob Optim. doi: 10.1007/s10898-013-0138-y
  14. Wang HJ, Wu LD, Wu WL, Wu JL (2014b) Minimum number of disjoint linear forests covering a planar graph. J Comb Optim 28:274–287Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Huijuan Wang
    • 1
  • Lidong Wu
    • 2
  • Xin Zhang
    • 3
  • Weili Wu
    • 4
    • 5
  • Bin Liu
    • 6
    Email author
  1. 1.College of MathematicsQingdao UniversityQingdaoChina
  2. 2.Department of Computer ScienceUniversity of Texas at TylerTylerUSA
  3. 3.School of Mathematics and StatisticsXidian UniversityXi’anChina
  4. 4.College of Computer Science and TechnologyTaiyuan University of TechnologyTaiyuanChina
  5. 5.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  6. 6.Department of MathematicsOcean University of ChinaQingdaoChina

Personalised recommendations