Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9515902 | Journal of Combinatorial Theory, Series B | 2005 | 11 Pages |
Abstract
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree Î and with no isolated edges has an avd-coloring with at most Î+300 colors, provided that Î>1020.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hamed Hatami,