Abstract
We define G to be a planar graph with maximum degree \(\varDelta \). Suppose \(\varDelta \ge 8\) and G has no adjacent p,q-cycles for some p, \(q\in \{3,4,5,6,7,8\}\), then G can be totally colored by \((\varDelta +1)\) colors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors.
References
Behzad M (1965) Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University
Bondy JA, Murty USR (1982) Graph theory with applications. North-Holland, NewYork
Borodin OV, Kostochka AV, Woodall DR (1997) Total colorings of planar graphs with large maximum degree. J Graph Theory 26:53–59. https://doi.org/10.1002/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.0.CO;2-G
Chang J, Wang HJ, Wu JL (2013) Total coloring of planar graphs with maximum degree 8 and without 5-cycles with two chords. Theor Comput Sci 476:16–23. https://doi.org/10.1016/j.tcs.2013.01.015
Du DZ, Shen L, Wang Y (2009) Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. Discrete Appl Math 157:2778–2784. https://doi.org/10.1016/j.dam.2009.02.011
Hou JF, Zhu Y, Liu ZG, Wu JL (2008) Total colorings of planar graphs without small cycles. Graphs Comb 24:91–100. https://doi.org/10.1007/s00373-008-0778-8
Kostochka AV (1996) The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Math 162:199–214. https://doi.org/10.1016/0012-365X(95)00286-6
Kowalik Ł, Sereni J-S, \(\check{S}\)krekovski R (2008) Total-colorings of plane graphs with maximum degree nine. SIAM J Discrete Math 22:1462–1479. https://doi.org/10.1137/070688389
Sánchez-Arroyo A (1989) Determining the total coloring number is NP-hard. Discrete Math 78:315–319. https://doi.org/10.1016/0012-365X(89)90187-8
Sanders DP, Zhao Y (1999) On total 9-coloring planar graphs of maximum degree seven. J Graph Theory 31:67–73. https://doi.org/10.1002/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C
Shen L, Wang YQ (2009) Total colorings of planar graphs with maximum degree at least 8. Sci China Ser A Math 52:1733–1742. https://doi.org/10.1007/s11425-008-0155-3
Tan X, Chen HY, Wu JL (2009) Total colorings of planar graphs without adjacent \(4\)-cycles. Lecture Notes Oper Res 10:167–173
Vizing VG (1968) Some unsolved problems in graph theory. UspekhiMat Nauk 23:117–134
Wang WF (2007) Total chromatic number of planar graphs with maximum degree ten. J Graph Theory 54:91–102. https://doi.org/10.1002/jgt.20195
Wang HJ, Wu LD, Wu JL (2014) Total coloring of planar graphs with maximum degree \(8\). Theor Comput Sci 522:54–61. https://doi.org/10.1016/j.tcs.2013.12.006
Wang HJ, Gu Y, Liu B (2017) Total coloring of planar graphs without adjacent short cycles. J Comb Optim 33(1):265–274. https://doi.org/10.1007/s10878-015-9954-y
Xu RY, Wu JL, Wang HJ (2014) Total coloring of planar graphs without some chordal 6-cycles. Bull Malays Math Sci Soc 520:124–129. https://doi.org/10.1007/s40840-014-0036-6
Acknowledgements
We thanks for the support by Shandong Provincial Natural Science Foundation of China under Grant ZR2020MA045.
Funding
The authors have not disclosed any funding.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Wang, L., Wang, H. & Wu, W. Minimum total coloring of planar graphs with maximum degree 8. J Comb Optim 45, 82 (2023). https://doi.org/10.1007/s10878-023-01011-y
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-023-01011-y