English

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

Combinatorics 2020-02-25 v1

Abstract

In 1965, Vizing proved that every planar graph GG with maximum degree Δ8\Delta\geq 8 is edge Δ\Delta-colorable. It is also proved that every planar graph GG with maximum degree Δ=7\Delta=7 is edge Δ\Delta-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 Δ\Delta at least seven is edge Δ\Delta-colorable.

Keywords

Cite

@article{arxiv.2002.10109,
  title  = {The edge colorings of $K_{5}$-minor free graphs},
  author = {Jieru Feng and Yuping Gao and Jianliang Wu},
  journal= {arXiv preprint arXiv:2002.10109},
  year   = {2020}
}

Comments

14 pages, 1 figure