The edge colorings of K5-minor free graphs

Abstract

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

0

Discussion (0)

Sign in to join the discussion.

Loading comments…