Strong edge-colorings for k-degenerate graphs

Abstract

We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $\Delta$ is at most $(4k-2)\Delta -k(2k-1)+1$.

References in corpus (1)

• A note on strong edge-colorings of 2-degenerate graphs

Cited by in corpus (4)

• Strong chromatic index of k-degenerate graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• Odd graph and its applications to the strong edge coloring
• The strong chromatic index of 1-planar graphs