Bounding the weight choosability number of a graph

Ben Seamone

Let $G=(V,E)$ be a graph, and for each $e\in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G)\to {\cup }_{e\in E(G)}{L}_e$ be an edge weighting function such that $w(e) \in…