arXiv subjects
Publications and source records attributed to Jieru Feng.
For a planar graph $G$, Borodin stated that $G$ is $(Δ+1)$-edge-choosable if $Δ\geq9$ and later Bonamy showed that $G$ is $9$-edge-choosable if $Δ=8$. At the same time, Borodin et al. proved that $G$ is $Δ$-edge-choosable if $Δ\geq12$. In the paper, we extend these results to $K_5$-minor free graphs.
In 1965, Vizing proved that every planar graph $G$ with maximum degree $Δ\geq 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 $K_5$-minor free graph with maximum degree $Δ$ at least seven is edge $Δ$-colorable.