| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653482 | European Journal of Combinatorics | 2014 | 8 Pages |
Abstract
In this paper we show that if we distinguish the vertices by color walks emanating from them, not just by their palettes, then the number of colors we need is very close to the chromatic index. Actually, not greater than Î(G)+1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
RafaÅ Kalinowski, Monika PilÅniak, Jakub PrzybyÅo, Mariusz Woźniak,