A proper vertex coloring φ of a graph G is said to be odd if for each non-isolated vertex x∈V(G) there exists a color c such that |φ-1(c)∩NG(x)| is odd. A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove every 1-planar graph admits an odd 21-coloring. This improves a recently obtained bound
23
due to Cranston
Lafferty and Song.
关键词
Keywords
references
BONDY J A, MURTY U S R. Graph theory[M]. New York:Springer, 2008.
PETRUˇSEVSKI M,ˇSKREKOVSKI R. Colorings with neighborhood parity condition[J]. Discrete Applied Mathematics, 2022, 321:385-391.
CARO Y, PETRUˇSEVSKI M,ˇSKREKOVSKI R. Remarks on odd colorings of graphs[J]. Discrete Applied Mathematics, 2022, 321:392-401.
PETR J, PORTIER J. The odd chromatic number of a planar graphs is at most 8[J]. Graphs and Combinatorics, 2023, 39(2):1-8.
CHO E K, CHOI I, KWON H, et al. Odd coloring of sparse graphs and planar graphs[J]. Discrete Mathematics, 2023, 346(5):113305.
CRANSTON D W, LAFFERTY M, SONG Z X. A note on odd colorings of 1-planar graphs[J]. Discrete Applied Mathematics, 2023, 330:112-117.