Strong edge coloring sparse graphs

DOI10.1016/J.ENDM.2015.06.104zbMATH Open1346.05058OpenAlexW2242678273MaRDI QIDQ324370FDOQ324370

Authors: Julien Bensmail, Marthe Bonamy, Hervé Hocquard 

Publication date: 14 October 2016

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

Recommendations

• Strong edge-coloring of some sparse graphs
• A note on strong edge coloring of sparse graphs
• Strong edge-colouring of sparse planar graphs
• Strong edge colorings of graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• scientific article; zbMATH DE number 1229619
• List strong edge-colorings of sparse graphs
• Acyclic edge coloring of sparse graphs
• Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors

zbMATH Keywords

strong chromatic indexdischarging methodmaximum average degreestrong edge coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• The strong chromatic index ofC4-free graphs
• Strong edge-colouring of sparse planar graphs
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs

Cited In (16)

• Strong edge coloring of subquartic graphs
• The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
• On strong edge-coloring of graphs with maximum degree 5
• Strong edge-colouring of sparse planar graphs
• Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
• Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
• Strong edge-coloring of cubic bipartite graphs: a counterexample
• On strong edge-coloring of graphs with maximum degree 4
• A note on strong edge coloring of sparse graphs
• Recent progress on strong edge-coloring of graphs
• Strong chromatic index of graphs with maximum degree four
• Strong edge-coloring of some sparse graphs
• The tight bound for the strong chromatic indices of claw-free subcubic graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-colorings of sparse graphs with large maximum degree
• Strong edge coloring of Cayley graphs and some product graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324370)