English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Odd coloring is a proper coloring with an additional restriction that everynon-isolated vertex has some color that appears an odd number of times in itsneighborhood. The minimum number of colors $k$ that can ensure an odd coloringof a graph $G$ is denoted by $\chi_o(G)$. We say $G$ is odd $k$-colorable if$\chi_o(G)\le k$. This notion is introduced very recently by Petru\v{s}evskiand \v{S}krekovski, who proved that if $G$ is planar then $ \chi_{o}(G) \leq 9$. A toroidal graph is a graph that can be embedded on a torus. Note that a$K_7$ is a toroidal graph, $\chi_{o}(G)\leq7$. Tian and Yin proved that everytoroidal graph is odd $9$-colorable and every toroidal graph without $3$-cyclesis odd $9$-colorable. In this paper, we proved that every toroidal graphwithout adjacent $3$-cycles is odd $8$-colorable.

Every toroidal graphs without adjacent triangles is odd 8-colorable