Article ID Journal Published Year Pages File Type
4647466 Discrete Mathematics 2006 7 Pages PDF
Abstract
We present some general results on d-strong edge colorings of circulant graphs. We determine exact values of the d-strong chromatic index for circulant graphs Cn(1,2) for d=1 and d=2, we also prove that the difference between the d-strong chromatic index and its trivial lower bound can be arbitrarily large.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Arbitrarily large difference between d-strong chromatic index and its trivial lower bound
Authors
, ,