English

Strong edge-colorings for k-degenerate graphs

Combinatorics 2013-04-02 v3

Abstract

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

Keywords

Cite

@article{arxiv.1212.6093,
  title  = {Strong edge-colorings for k-degenerate graphs},
  author = {Gexin Yu},
  journal= {arXiv preprint arXiv:1212.6093},
  year   = {2013}
}