Abstract
Let k and r be two positive integers. An r-dynamic coloring of a graph G is a proper k-coloring \(\varphi \) such that \(\mid \varphi (N_{G}(v))\mid \ge \) min\(\{d_{G}(v),r\}\) for each \(v\in V(G)\). In this paper, we study the r-dynamic coloring of planar graphs without 3-,5-cycle, and 4-cycle is not adjacent to \(7^{-}\)-cycles. We prove that the upper bound of r-dynamic chromatic number of such graph is \(r+3\) if \(r\ge 14\).
This work is supported by a research grant NSFC (11271334).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borodin, O.V., Broersma, H.J., Glebov, A., Heuvel, J.V.D.: Stars and bunches in planar graphs. Part II: General planar graphs and colourings. CDAM researches report 2002-05 (2002)
Bu, Y.H., Cao, J.J.: 2-distance coloring of planar graph. Discrete Appl. Math. 13, 2150007 (2021)
La, H., Montassier, M., Pinlou, A., et al.: r-hued (r+1)-coloring of planar graphs with girth at least 8 for r\(\ge 9\). Eur. J. Comb. 91, 103219 (2021)
Montgomery, B.: Dynamic Coloring of Graphs. West Virginia University, Morgantwon (2001)
Song, H.M., Lai, H.J.: Upper bounds of r-hued colorings of planar graphs. Discrete Appl. Math. 243, 262–269 (2018)
Song, H.M., Lai, H.J., Wu, J.L.: On r-hued coloring of planar graphs with girth at least 6. Discrete Appl. Math. 198, 251–263 (2016)
Wegner, G.: Graphs with given diameter and a coloring problem. Technical Report, University of Dortmund (1977)
Wang, X.F.: r-Dynamic Coloring of Planar Graphs. Zhejiang Noamal University, Jinhua (2020)
Yi, D., Zhu, J.L., Feng, L.X., et al.: Optimal r-dynamic coloring of sparse graphs. J. Comb. Optim. 38, 545–555 (2019)
Zhu, J.L.: \(L(2,1)\)-Labeling and r-Dynamic Coloring. Zhejiang Noamal University, Jinhua (2019)
Zhu, J.L., Bu, Y.H.: Minimum 2-distance coloring of planar graphs and channel assignment. J. Comb. Optim. 36, 55–64 (2018)
Zhu, H., Gu, Y., Sheng, J., Lv, X.: List 2-distance \((\Delta + 3)\)-coloring of planar graphs without 4,5-cycles. J. Comb. Optim. 36, 1411–1424 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bu, Y., Yang, R., Zhu, H. (2022). The r-Dynamic Chromatic Number of Planar Graphs Without Special Short Cycles. In: Ni, Q., Wu, W. (eds) Algorithmic Aspects in Information and Management. AAIM 2022. Lecture Notes in Computer Science, vol 13513. Springer, Cham. https://doi.org/10.1007/978-3-031-16081-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-16081-3_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-16080-6
Online ISBN: 978-3-031-16081-3
eBook Packages: Computer ScienceComputer Science (R0)