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 {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G, \sigma)$ is afamily of sign-circuits which covers all edges of $(G, \sigma)$. The shortestsign-circuit cover problem was initiated by M\'a$\check{\text{c}}$ajov\'a,Raspaud, Rollov\'a, and \v{S}koviera (JGT 2016) and received many attentions inrecent years. In this paper, we show that every flow-admissible 3-edgecolorable cubic signed graph $(G, \sigma)$ has a sign-circuit cover with lengthat most $\frac{20}{9} |E(G)|$.

A note on shortest circuit cover of 3-edge colorable cubic signed graphs