Strong edge-colorings for k-degenerate graphs

2012/12/25 by Gexin Yu, Yu, Gexin
Mathematics · #05C #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C

paper · pdf · doi:10.48550/arxiv.1212.6093

arxiv created 2013/03/31 · arxiv updated 2013/04/02

Abstract

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

Related

• Strong edge-coloring of 2-degenerate graphs
• A note on strong edge-colorings of 2-degenerate graphs
• The Strong Chromatic Index of graphs with maximum degree Δ
• Strong chromatic index of graphs with maximum degree four
• Strong chromatic index of sparse graphs