Strong edge coloring sparse graphs

DOI10.1016/j.endm.2015.06.104zbMath1346.05058OpenAlexW2242678273MaRDI QIDQ324370

Julien Bensmail, Hervé Hocquard, Marthe Bonamy

Publication date: 14 October 2016

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01264420/file/degree4.pdf

zbMATH Keywords

strong chromatic indexdischarging methodmaximum average degreestrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (4)

On strong edge-coloring of graphs with maximum degree 4 ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ Strong edge coloring of Cayley graphs and some product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Strong edge-colouring of sparse planar graphs
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• Induced matchings in bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-colouring and induced matchings
• The strong chromatic index ofC4-free graphs

This page was built for publication: Strong edge coloring sparse graphs