@article{5a649b7e55cd44a596cdcdeb63de3edf,
title = "A new type of edge-derived vertex coloring",
abstract = "We study the minimum number of weights assigned to the edges of a graph G with no component K2 so that any two adjacent vertices have distinct sets of weights on their incident edges. The best possible upper bound on this parameter is proved.",
keywords = "Chromatic number, Edge coloring, Edge-weighting",
author = "Ervin Gyori and Cory Palmer",
note = "Funding Information: The authors would like to thank the anonymous referees for their careful reading of the manuscript for errors and for valuable suggestions for improving the presentation of several of the proofs. The first author was partially supported by the Hungarian OTKA Grant AT 48826 and by ToK project FIST of R{\'e}nyi Institute in the 6th Framework Program of the European Union.",
year = "2009",
month = nov,
day = "28",
doi = "10.1016/j.disc.2008.11.014",
language = "English",
volume = "309",
pages = "6344--6352",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "22",
}