Upper Bounds on the Chromatic Index of Linear Hypergraphs

Thomas Murff, Xerxes D. Arsiwalla

We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving g…