Strong edge-coloring of graphs with maximum degree 4 using 22 colors

Daniel W. Cranston. Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Mathematics, 306(21):2772-2778, 2006. [doi]

Abstract

Abstract is missing.