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 1965, Vizing proved that every planar graph $G$ with maximum degree$\Delta\geq 8$ is edge $\Delta$-colorable. It is also proved that every planargraph $G$ with maximum degree $\Delta=7$ is edge $\Delta$-colorable by Sandersand Zhao, independently by Zhang. In this paper, we extend the above results byshowing that every $K_5$-minor free graph with maximum degree $\Delta$ at leastseven is edge $\Delta$-colorable.

The edge colorings of $K_{5}$-minor free graphs