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

It follows from the work of Tait and the Four-Color-Theorem that a planarcubic graph is 3-edge-colorable if and only if it contains no bridge. Weconsider the question of which planar graphs are subgraphs of planar cubicbridgeless graphs, and hence 3-edge-colorable. We provide an efficientrecognition algorithm that given an $n$-vertex planar graph, augments thisgraph in $O(n^2)$ steps to a planar cubic bridgeless supergraph, or decidesthat no such augmentation is possible. The main tools involve the GeneralizedAntifactor-problem for the fixed embedding case, and SPQR-trees for thevariable embedding case.

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs