Improved bounds for the chromatic index
โ
Hakimi, S. Louis; Schmeichel, Edward F.
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 321 KB
๐ 2 views
We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index ฯ (G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G (i.e., the subgraph of G induced by the vertices of degree