English

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

Combinatorics 2024-03-28 v2

Abstract

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

Keywords

Cite

@article{arxiv.1212.6092,
  title  = {A note on strong edge-colorings of 2-degenerate graphs},
  author = {Rong Luo and Gexin Yu},
  journal= {arXiv preprint arXiv:1212.6092},
  year   = {2024}
}

Comments

Stronger results are known