Skip to main content
SpringerLink
Log in

Weak-Dynamic Coloring of Graphs Beyond-Planarity

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A weak-dynamic coloring of a graph is a vertex coloring (not necessarily proper) in such a way that each vertex of degree at least two sees at least two colors in its neighborhood. It is proved that the weak-dynamic chromatic number of the class of k-planar graphs (resp. IC-planar graphs) is equal to (resp. at most) the chromatic number of the class of 2k-planar graphs (resp. 1-planar graphs), and therefore every IC-planar graph has a weak-dynamic 6-coloring (being sharp) and every 1-planar graph has a weak-dynamic 9-coloring. Moreover, we conclude that the well-known Four Color Theorem is equivalent to the proposition that every planar graph has a weak-dynamic 4-coloring, or even that every \(C_4\)-free bipartite planar graph has a weak-dynamic 4-coloring. It is also showed that deciding if a given graph has a weak-dynamic k-coloring is NP-complete for every integer \(k\ge 3\).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data Availability

Data sharing not applicable to this article as no data sets were generated or analysed during the current study.

References

  1. Accurso, C., Chernyshov, V., Hand, L., Jahanbekam, S., Wenger. P.: Weak dynamic coloring of planar graphs. arXiv:1802.05953

  2. Angelini, P., Bekos, M.A., Kaufmann, M., Schneck, T.: Efficient generation of different topological representations of graphs beyond-planarity. In: Toth, C.D., Archambault, D. (eds.) Proceedings of 27th International Symposium on Graph Drawing (GD 2019) (2019)

  3. Bannister, M.J., Cabello, S., Eppstein, D.: Parameterized complexity of 1-planarity. J. Graph Algorithms Appl. 22(1), 23–49 (2018)

    Article  MathSciNet  Google Scholar 

  4. Borodin, O.: A new proof of the 6 color theorem. J. Graph Theory 19(4), 507–521 (1995)

    Article  MathSciNet  Google Scholar 

  5. Borodin, O.V.: Solution of the ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskretnogo Analiza 108(41), 12–26 (1984)

    MathSciNet  Google Scholar 

  6. Brandenburg, F.J., Didimo, W., Evans, W.S., Kindermann, P., Liotta, G., Montecchiani, F.: Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. 636, 1–16 (2016)

    Article  MathSciNet  Google Scholar 

  7. Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803–1829 (2013)

    Article  MathSciNet  Google Scholar 

  8. Chen, Y., Fan, S., Lai, H.-J., Song, H., Sun, L.: On dynamic coloring for planar graphs and graphs of higher genus. Discrete Appl. Math. 160(7–8), 1064–1071 (2012)

    Article  MathSciNet  Google Scholar 

  9. Chen, Y., Fan, S., Lai, H.-J., Xu, M.: Graph \(r\)-hued colorings—a survey. Discrete Appl. Math. 321, 24–48 (2022)

    Article  MathSciNet  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1990)

    Google Scholar 

  11. Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1–11 (2007)

    Article  MathSciNet  Google Scholar 

  12. Hu, X., Kong, J.: An improved upper bound for the dynamic list coloring of 1-planar graphs. AIMS Math. 7(5), 7337–7348 (2022)

    Article  MathSciNet  Google Scholar 

  13. Jahanbekam, S., Kim, J., Suil, O., West, D.: On r-dynamic coloring of graphs. Discrete Appl. Math. 206, 65–72 (2016)

    Article  MathSciNet  Google Scholar 

  14. Karpov, D.V.: An upper bound on the chromatic number of 2-planar graphs. Discuss. Math. Graph Theory 43(3), 703–720 (2023)

    Article  MathSciNet  Google Scholar 

  15. Kim, S.-J., Lee, S., Park, W.-J.: Dynamic coloring and list dynamic coloring of planar graphs. Discrete Appl. Math. 161(13–14), 2207–2212 (2013)

    Article  MathSciNet  Google Scholar 

  16. Kim, Y., Lee, S., Oum, S.-I.: Dynamic coloring of graphs having no \(K_5\) minor. Discrete Appl. Math. 206, 81–89 (2016)

    Article  MathSciNet  Google Scholar 

  17. Kobourov, S., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49–67 (2017)

    Article  MathSciNet  Google Scholar 

  18. Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. J. Graph Theory 72(1–2), 30–71 (2013)

    Article  MathSciNet  Google Scholar 

  19. Kostochka, A., Stiebitz, M., Wirth, B.: The colour theorems of brooks and gallai extended. Discrete Math. 162(1), 299–303 (1996)

    Article  MathSciNet  Google Scholar 

  20. Král’, D., Stacho, L.: Coloring plane graphs with independent crossings. J. Graph Theory 64(3), 184–205 (2010)

    Article  MathSciNet  Google Scholar 

  21. Lai, H.-J., Lin, J., Montgomery, B., Shui, T., Fan, S.: Conditional colorings of graphs. Discrete Math. 306(16), 1997–2004 (2006)

    Article  MathSciNet  Google Scholar 

  22. Lai, H.P.H.-J., Montgomery, B.: Upper bounds of dynamic chromatic number. Ars Combin. 68, 193–201 (2003)

    MathSciNet  Google Scholar 

  23. Montgomery, B.: Dynamic coloring of graphs. PhD thesis, West Virginia University (2001)

  24. Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17, 427–439 (1997)

    Article  MathSciNet  Google Scholar 

  25. Ringel, G.: Ein sechsfarbenproblem auf der kugel. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 29(1–2), 107–117 (1965)

    Article  MathSciNet  Google Scholar 

  26. Schaefer, M.: Crossing numbers of graphs. Discrete Math. Appl. CRC Press, Boca Raton (2018)

  27. Urschel, J.C., Wellens, J.: Testing gap \(k\)-planarity is NP-complete. Inf. Process. Lett. 169, 8 (2021). (Id/No 106083)

    Article  MathSciNet  Google Scholar 

  28. Zhang, X.: Drawing complete multipartite graphs on the plane with restrictions on crossings. Acta Math. Sin. Engl. Ser. 30(12), 2045–2053 (2014)

    Article  MathSciNet  Google Scholar 

  29. Zhang, X., Li, Y.: Dynamic list coloring of 1-planar graphs. Discrete Math. 344(5), 8 (2021) (Id/No 112333)

Download references

Acknowledgements

The authors thank Zicheng Ye and Tong Li for their helpful discussions.

Funding

This article has not received funding support.

Author information

Authors and Affiliations

  1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China

    Weichan Liu & Guiying Yan

  2. University of Chinese Academy of Sciences, Beijing, China

    Weichan Liu & Guiying Yan

Authors
  1. Weichan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guiying Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guiying Yan.

Ethics declarations

Conflict of interest

The authors declare that no funds, grants, or other support were received during the preparation of this manuscript. The authors have no relevant financial or non-financial interests to disclose.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, W., Yan, G. Weak-Dynamic Coloring of Graphs Beyond-Planarity. Graphs and Combinatorics 40, 7 (2024). https://doi.org/10.1007/s00373-023-02733-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-023-02733-w

Keywords

Search

Navigation