The edge colorings of K5K_{5}-minor free graphs

preprint2020arXivOpen access

Abstract

In 1965, Vizing proved that every planar graph GG with maximum degree Δ≥8Δ\geq 8 is edge ΔΔ-colorable. It is also proved that every planar graph GG with maximum degree Δ=7Δ=7 is edge ΔΔ-colorable by Sanders and Zhao, independently by Zhang. In this paper, we extend the above results by showing that every K5K_5-minor free graph with maximum degree ΔΔ at least seven is edge ΔΔ-colorable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.