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

Decomposing a digraph into subdigraphs with a fixed structure or property isa classical problem in graph theory and a useful tool in a number ofapplications of networks and communication. A digraph is strongly connected ifit contains a directed path from each vertex to all others. In this paper weconsider multipartite tournaments, and we study the existence of a partition ofa multipartite tournament with $c$ partite sets into strongly connected$c$-tournaments. This is a continuation of the study started in 1999 byVolkmann of the existence of strongly connected subtournaments in multipartitetournaments.

Decomposition of balanced multipartite tournaments into strongly connected tournaments