Title of article :
A Bound on the Strong Chromatic Index of a Graph
Author/Authors :
Molloy، نويسنده , , Michael and Reed، نويسنده , , Bruce، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Abstract :
We show that the strong chromatic index of a graph with maximum degreeΔ; is at most (2−ε)Δ2, for someε>0. This answers a question of Erdős and Nešetřil.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
