Hannah Reavis
Advisor: Dr. Joshua Harrelson
For a graph G and nonnegative integer k, we say
G is a k-list-edge-critical graph if χ′_l (G)> k, but χ′_l (G−e)≤ k for all
e ∈ E(G). We survey a few known lemmas for (∆ +
1)-list-edge-critical graphs and show how these lemmas achieve χ′_l (G)≤ ∆ + 1
for certain families of G.