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 \emph{co-bipartite chain} graph is a co-bipartite graph in which theneighborhoods of the vertices in each clique can be linearly ordered withrespect to inclusion. It is known that the maximum cut problem (MaxCut) isNP-Hard in co-bipartite graphs. We consider MaxCut in co-bipartite chaingraphs. We first consider the twin-free case and present an explicit solution.We then show that MaxCut is polynomial time solvable in this graph class.

The Maximum Cut Problem in Co-bipartite Chain Graphs