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

Full-text links:

Download:

math.CO

(Submitted on 25 Dec 2012 (v1), last revised 27 Mar 2024 (this version, v2))

Abstract: We show that every 2-degenerate graph with maximum degree $\Delta$ has a strong edge-coloring with at most $8\Delta-4$ colors.

Comments:	Stronger results are known
Subjects:	Combinatorics (math.CO)
Cite as:	arXiv:1212.6092 [math.CO]
	(or arXiv:1212.6092v2 [math.CO] for this version)

From: Gexin Yu [view email]
[v1] Tue, 25 Dec 2012 22:24:29 GMT (6kb)
[v2] Wed, 27 Mar 2024 02:14:26 GMT (0kb,I)