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

A tripartite-circle drawing of a tripartite graph is a drawing in the plane,where each part of a vertex partition is placed on one of three disjointcircles, and the edges do not cross the circles. The tripartite-circle crossingnumber of a tripartite graph is the minimum number of edge crossings among allits tripartite-circle drawings. We determine the exact value of thetripartite-circle crossing number of $K_{a,b,n}$, where $a,b\leq 2$.

The tripartite-circle crossing number of graphs with two small partition classes