Strong edge coloring sparse graphs

Abstract : A strong edge coloring of a graph is a proper edge coloring such that no edge has two incident edges of the same color. Erdős and Nešetřil conjectured in 1989 that $5 /4∆2$ colors are always enough for a strong edge coloring, where $∆$ is the maximum degree of the graph. In the specific case where $∆ = 4$, we prove this to be true when there is no subgraph with average degree at least $4 − 1/5$ , and show that fewer colors are necessary when the graph is even sparser.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264420
Contributor : Alexandre Pinlou <>
Submitted on : Wednesday, July 27, 2016 - 10:25:02 AM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM

File

degree4.pdf
Files produced by the author(s)

Identifiers

Citation

Julien Bensmail, Marthe Bonamy, Hervé Hocquard. Strong edge coloring sparse graphs. Electronic Notes in Discrete Mathematics, Elsevier, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778. ⟨10.1016/j.endm.2015.06.104⟩. ⟨lirmm-01264420⟩

Share

Metrics

Record views

346

Files downloads

314