Skip to main content

Advertisement

Springer Nature Link
Log in

List edge and list total coloring of planar graphs with maximum degree 8

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Let \(G\) be a planar graph with maximum degree \(\varDelta \ge 8\) and without chordal 5-cycles. Then \(\chi '_{l}(G)=\varDelta \) and \(\chi ''_{l}(G)=\varDelta +1\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  • Angelini P, Frati F (2012) Acyclically 3-colorable planar graphs. J Comb Optim 24:116–130

    Article  MathSciNet  MATH  Google Scholar 

  • Borodin OV, Kostochka AV, Woodall DR (1997) List edge and list total colourings of multigraphs. J Comb Theory Ser B 71:184–204

    Article  MathSciNet  MATH  Google Scholar 

  • Du HW, Jia XH, Li DY, Wu WL (2004) Coloring of double disk graphs. J Global Optim 28:115–119

    Article  MathSciNet  MATH  Google Scholar 

  • Garg N, Papatriantafilou M, Tsigas P (1996) Distributed list coloring: how to dynamically allocate frequencies to mobile base stations. In: Eighth IEEE symposium on parallel and distributed processing, pp 18–25. doi:10.1109/SPDP.1996.570312

  • Hägkvist R, Chetwynd A (1992) Some upper bounds on the total and list chromatic numbers of multigraphs. J Graph Theory 16:503–516

    Article  MathSciNet  MATH  Google Scholar 

  • Hou JF, Liu GZ, Cai JS (2006) List edge and list total colorings of planar graphs without 4-cycles. Theor Comput Sci 369:250–255

    Article  MathSciNet  MATH  Google Scholar 

  • Jensen T, Toft B (1995) Graph coloring problems. Wiley-Interscience, New York

    MATH  Google Scholar 

  • 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–736

    Article  MathSciNet  MATH  Google Scholar 

  • Li R, Xu BG (2011) Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discret Math 311:2158–2163

    Article  MathSciNet  MATH  Google Scholar 

  • Liu B, Hou JF, Wu JL, Liu GZ (2009) Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret Math 309:6035–6043

    Article  MathSciNet  MATH  Google Scholar 

  • Wang HJ, Wu LD, Wu WL, Wu JL (2014) Minimum number of disjoint linear forests covering a planar graph. J Comb Optim 28:274–287

    Article  MathSciNet  MATH  Google Scholar 

  • Wang HJ, Wu LD, Zhang X, Wu WL, Liu B (2014) A note on the minimum number of choosability of planar graphs. J Comb Optim doi:10.1007/s10878-014-9805-2

  • Wang HJ, Wu LD, Wu WL, Pardalos PM, Wu JL (2014) Minimum total coloring of planar graph. J Global Optim 60:777–791

    Article  MathSciNet  MATH  Google Scholar 

  • Wang W, Liu X (2005) List coloring based channel allocation for open-spectrum wireless networks. In: IEEE 62nd vehicular technology conference (VTC 2005-Fall) (1):690–694, doi:10.1109/VETECF.2005.1558001

Download references

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China under Grants 11201440, 11271006, 11301410, 11401386, 71171120, the Projects of International (Regional) Cooperation and Exchanges of NSFC (71411130215), the Specialized Research Fund for the Doctoral Program of Higher Education (20133706110002), the Shandong Provincial Natural Science Foundation of China under Grant ZR2014AQ001, the Natural Science Basic Research Plan in Shanxi 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 BS2013-DX002.

Author information

Authors and Affiliations

  1. College of Mathematics, Qingdao University, Qingdao, 266071, China

    Huijuan Wang & Hongwei Gao

  2. Department of Mathematics, Ocean University of China, Qingdao, 266100, China

    Bin Liu

  3. School of Mathematics and Statistics, Xidian University, Xi’an, 710071, China

    Xin Zhang

  4. Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA

    Lidong Wu

  5. College of Computer Science and Technology, TaiYuan University of Technology, Taiyuan, 030024, China

    Weili Wu

  6. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA

    Weili Wu

Authors
  1. Huijuan Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Bin Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xin Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Lidong Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Weili Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Hongwei Gao
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Huijuan Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, H., Liu, B., Zhang, X. et al. List edge and list total coloring of planar graphs with maximum degree 8. J Comb Optim 32, 188–197 (2016). https://doi.org/10.1007/s10878-015-9870-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9870-1

Keywords

Profiles

  1. Hongwei Gao View author profile