Title of article
A Bound on the Strong Chromatic Index of a Graph
Author/Authors
Molloy، نويسنده , , Michael and Reed، نويسنده , , Bruce، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
7
From page
103
To page
109
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
Serial Year
1997
Journal title
Journal of Combinatorial Theory Series B
Record number
1526211
Link To Document