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

In an attempt to find a polynomial-time algorithm for the edge-clique coverproblem on cographs we tried to prove that the edge-clique graphs of cographshave bounded rankwidth. However, this is not the case. In this note we showthat the edge-clique graphs of cocktail party graphs have unbounded rankwidth.

Edge-clique graphs of cocktail parties have unbounded rankwidth