The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs

Let G be a graph and k a positive integer. A strong k -edge-coloring of G is a mapping ϕ : E ( G ) → { 1 , 2 , ⋯ , k } such that for any two edges e and e ′ that are either adjacent to each other or adjacent to a common edge, ϕ ( e ) ≠ ϕ ( e ′ ) . The strong chromatic index of G , denoted as χ s ′ (...

Ausführliche Beschreibung