|
|||||
|
|
A new type of edge-derived vertex coloring |
|
| Authors: | Ervin Gy?ri Cory Palmer |
| Affiliation: | a Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, P.O.B. 127, Budapest H-1364, Hungary b Central European University, Department of Mathematics and its Applications, Nádor u. 9, Budapest H-1051, Hungary |
| 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: | Edge coloring Chromatic number Edge-weighting |
| 本文献已被 ScienceDirect 等数据库收录！ | |