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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An odd coloring of a graph G is an assignment of colors to the edges of G in a way that each vertex is incident to either zero or an odd number of edges of each color. The minimum number of colors needed in such a coloring is called the odd chromatic index of G, and it is denoted by χo(G). This notion was introduced by Pyber, who showed that χo(G) ≤ 4 holds for every graph G. In this paper, we show that almost every graph on an even (resp. odd) number of vertices satisfies χo(G) = 2 (resp. χ ′ o(G) = 3).

The odd chromatic index of almost all graphs