Every toroidal graphs without adjacent triangles is odd 8-colorable

arXiv2206.07629MaRDI QIDQ6402196FDOQ6402196

Authors: Fangyu Tian, Yuxue Yin 

Publication date: 15 June 2022

Abstract: Odd coloring is a proper coloring with an additional restriction that every non-isolated vertex has some color that appears an odd number of times in its neighborhood. The minimum number of colors $k$ that can ensure an odd coloring of a graph $G$ is denoted by $ch{i}_o(G)$. We say $G$ is odd $k$-colorable if $ch{i}_o(G)lek$. This notion is introduced very recently by Petruv{s}evski and v{S}krekovski, who proved that if $G$ is planar then $ch{i}_o(G)leq9$. A toroidal graph is a graph that can be embedded on a torus. Note that a $K_7$ is a toroidal graph, $ch{i}_o(G)leq7$. Tian and Yin proved that every toroidal graph is odd $9$-colorable and every toroidal graph without $3$-cycles is odd $9$-colorable. In this paper, we proved that every toroidal graph without adjacent $3$-cycles is odd $8$-colorable.

This page was built for publication: Every toroidal graphs without adjacent triangles is odd 8-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402196)