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

Let K  m -H be the graph obtained from K  m  by removing the edges set E(H) of H where H is a subgraph of K  m . In this paper, we characterize the potentially K 5-P 4 and K 5-Y 4-graphic sequences where Y 4 is a tree on 5 vertices and 3 leaves.

On potentially K 5-H-graphic sequences