Strong edge-colorings for k-degenerate graphs
classification
🧮 math.CO
keywords
strongchromaticdegeneratedegreedeltadelta-kedge-coloringsgraph
read the original abstract
We prove that the strong chromatic index for each $k$-degenerate graph with maximum degree $\Delta$ is at most $(4k-2)\Delta-k(2k-1)+1$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.