Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph

M. Henderson, A. J. W. Hilton, R. Mary Jeya Jothi

We show that for a simple graph $G$, $c^{\prime }(G)\le \Delta (G)+2$ where $c^{\prime }(G)$ is the choice index (or edge-list chromatic number) of $G$, and $\Delta (G)$ is the maximum degree of $G$. As a simpl…