Some Recent Results on Strong Edge-coloring of Graphs
Professor Gexin Yu
College of William and Mary
Abstract: A strong edge-coloring of a graph is a coloring of the edges of the graphs so that every set of edges of the same color induces a matching. In this talk, we will survey some recent results on this research subject.
Read More