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 conjecture of M\'a\u{c}ajov\'a and \u{S}koviera asserts that everybridgeless cubic graph has two perfect matchings whose intersection does notcontain any odd edge cut. We prove this conjecture for graphs with few verticesand we give a stronger result for traceable graphs.

M\'acajov\'a and \v{S}koviera Conjecture on Cubic Graphs