Edge coloring graphs with large minimum degree

Michael J. Plantholt, Songling Shan

Let $G$ be a simple graph with maximum degree $\Delta (G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta (G)\lfloor |V(H)|/2\rfloor$. Chetwynd and Hilton in 1985 conjectured that a gra…