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

Kang and Park recently showed that every cubic (loopless) multigraph isincidence 6-choosable [On incidence choosability of cubic graphs. \emph{arXiv},April 2018]. Equivalently, every bipartite graph obtained by subdividing onceevery edge of a cubic graph, is strongly 6-edge-choosable. The aim of this noteis to give a shorter proof of their result by looking at the strongedge-coloring formulation of the problem.

(2, 3)-bipartite graphs are strongly 6-edge-choosable