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 this paper, we study the minimum size 2-edge connected spanning subgraphproblem (henceforth 2EC) and show that every 3-edge connected cubic graph G=(V,E), with n=|V| allows a 2EC solution for G of size at most 7n/6, which improvesupon Boyd, Iwata and Takazawa's guarantee of 6n/5.

An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs