A note on the edge choosability of $K_{5}$-minor free graphs

Jieru Feng; Jianliang Wu; Fan Yang

A note on the edge choosability of $K_{5}$-minor free graphs

Combinatorics 2022-08-25 v1

Authors: Jieru Feng , Jianliang Wu , Fan Yang

Abstract

For a planar graph $G$ , Borodin stated that $G$ is $(\Delta+1)$ -edge-choosable if $\Delta \geq9$ and later Bonamy showed that $G$ is $9$ -edge-choosable if $\Delta=8$ . At the same time, Borodin et al. proved that $G$ is $\Delta$ -edge-choosable if $\Delta\geq12$ . In the paper, we extend these results to $K_5$ -minor free graphs.

Keywords

edge choosability k5-minor free graphs planar graphs graph coloring list coloring

Cite

@article{arxiv.2208.11263,
  title  = {A note on the edge choosability of $K_{5}$-minor free graphs},
  author = {Jieru Feng and Jianliang Wu and Fan Yang},
  journal= {arXiv preprint arXiv:2208.11263},
  year   = {2022}
}

Related papers

View all related →