Strong edge-colorings for k-degenerate graphs

preprint2013arXivOpen access

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

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract