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

In a (proper) edge-coloring of a bridgeless cubic graph G an edge e is rich(resp. poor) if the number of colors of all edges incident to end-vertices of eis 5 (resp. 3). An edge-coloring of G is is normal if every edge of G is eitherrich or poor. In this paper we consider snarks ~G obtained by a simplesuperposition of edges and vertices of a cycle C in a snark G: For an evencycle C we show that a normal coloring of G can be extended to a normalcoloring of ~G without changing colors of edges outside C in G: An interestingremark is that this is in general impossible for odd cycles, since the normalcoloring of a Petersen graph P10 cannot be extended to a superposition of P10on a 5-cycle without changing colors outside the 5-cycle. On the other hand, asour colorings of the superpositioned snarks introduce 18 or more poor edges, weare inclined to believe that every bridgeless cubic graph istinct from P10 hasa normal coloring with at least one poor edge and possibly with at least 6 ifwe also exclude the Petersen graph with one vertex truncated.

Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph