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

preprint2022arXivOpen access

Abstract

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

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.