1-planar graphs are odd 13-colorable
Discrete Mathematics(2023)
摘要
An odd coloring of a graph G is a proper coloring such that any non-isolated vertex in G has a color appearing an odd number of times on its neighbors. The odd chromatic number, denoted by chi o(G), is the minimum number of colors that admits an odd coloring of G. Petrusevski and Skrekovski in 2021 introduced this notion and proved that if G is planar, then chi o(G) < 9 and conjectured that chi o(G) < 5. More recently, Petr and Portier improved 9 to 8. A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. Cranston, Lafferty and Song showed that every 1-planar graph is odd 23-colorable. In this paper, we improved this result and showed that every 1-planar graph is odd 13-colorable.(c) 2023 Elsevier B.V. All rights reserved.
更多查看译文
关键词
Odd coloring,1-planar graphs
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要