The strong chromatic index of sparse graphs
We investigate an upper bound on the strong chromatic index of graphs. We confirm the conjecture of Chang and Narayanan. Strong chromatic index of k-degenerate graphs is linear in k times the maximum degree.
strong chromatic index sparse graphs combinatorial problems strong edge-coloring