Abstract
A majority coloring of a digraph D with k colors is an assignment π: V(D) → {1, 2, …, k} such that for every v ∈ V(D) we have π(w) = π(v) for at most half of all out-neighbors w ∈ N+(v). A digraph D is majority k-choosable if for any assignment of lists of colors of size k to the vertices, there is a majority coloring of D from these lists. We prove that if U(D) is a 1-planar graph without a 4-cycle, then D is majority 3-choosable. And we also prove that every NIC-planar digraph is majority 3-choosable.
References
M. Anastos, A. Lamaison, R. Steiner, T. Szabó: Majority colorings of sparse digraphs. Electron. J. Comb. 28 (2021), Article ID P2.31, 17 pages.
M. Anholcer, B. Bosek, J. Grytczuk: Majority choosability of digraphs. Electron. J. Comb. 24 (2017), Article ID P3.57, 5 pages.
O. V. Borodin: A new proof of the 6 color theorem. J. Graph Theory 19 (1995), 507–521.
J. Czap, P. Šugerek: Drawing graph joins in the plane with restrictions on crossings. Filomat 31 (2017), 363–370.
I. Fabrici, T. Madaras: The structure of 1-planar graphs. Discrete Math. 307 (2007), 854–865.
A. Girão, T. Kittipassorn, K. Popielarz: Generalized majority colourings of digraphs. Comb. Probab. Comput. 26 (2017), 850–855.
F. Knox, R. Šámal: Linear bound for majority colourings of digraphs. Electron. J. Comb. 25 (2018), Article ID P3.29, 4 pages.
S. Kreutzer, S. Oum, P. Seymour, D. van der Zypen, D. R. Wood: Majority colourings of digraphs. Electron. J. Comb. 24 (2017), Article ID P2.25, 9 pages.
W. Wang, K.-W. Lih: Coupled choosability of plane graphs. J. Graph Theory 58 (2008), 27–44.
W. Yang, W. Wang, Y. Wang: An improved upper bound for the acyclic chromatic number of 1-planar graphs. Discrete Appl. Math. 283 (2020), 275–291.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research has been supported by the National Natural Science Foundation of China (12071351) and the Natural Science Foundation of Shandong Province (ZR2020MA043).
Rights and permissions
About this article
Cite this article
Xia, W., Wang, J. & Cai, J. Majority choosability of 1-planar digraph. Czech Math J 73, 663–673 (2023). https://doi.org/10.21136/CMJ.2023.0170-22
Received:
Published:
Issue Date:
DOI: https://doi.org/10.21136/CMJ.2023.0170-22