The strong edge-coloring for graphs with small edge weight
Document Type
Article
Publication Date
4-1-2020
Abstract
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. The edge weight of a graph G is defined to be max{dG(u)+dG(v)|e=uv∈E(G)}. We study graphs with edge weight at most 7. We show that 1) every graph with edge weight at most 6 has a strong edge-coloring using at most 10 colors; and 2) every graph with edge weight at most 7 has a strong edge-coloring using at most 15 colors.
Repository Citation
Chen, L.,
Huang, M.,
Yu, G.,
& Zhou, X.
(2020). The strong edge-coloring for graphs with small edge weight. Discrete Mathematics, 343 (4).
https://corescholar.libraries.wright.edu/math/380
DOI
10.1016/j.disc.2019.111779
