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

There are many hard conjectures in graph theory, like Tutte's 5-flowconjecture, and the 5-cycle double cover conjecture, which would be true ingeneral if they would be true for cubic graphs. Since most of them aretrivially true for 3-edge-colorable cubic graphs, cubic graphs which are not3-edge-colorable, often called {\em snarks}, play a key role in this context.Here, we survey parameters measuring how far apart a non 3-edge-colorable graphis from being 3-edge-colorable. We study their interrelation and prove some newresults. Besides getting new insight into the structure of snarks, we show thatsuch measures give partial results with respect to these important conjectures.The paper closes with a list of open problems and conjectures.

On measures of edge-uncolorability of cubic graphs: A brief survey and some new results