A note on strong edge-colorings of 2-degenerate graphs
Abstract
We show that every 2-degenerate graph with maximum degree has a strong edge-coloring with at most 8-4 colors.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.