Strong edge-colorings for k-degenerate graphs
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.
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.