A new type of edge-derived vertex coloring

作者：Gyori Ervin^*; Palmer Cory

来源：Discrete Mathematics, 2009, 309(22): 6344-6352.

DOI：10.1016/j.disc.2008.11.014

• Edge coloring
• Chromatic number
• Edge-weighting

We study the minimum number of weights assigned to the edges of a graph G with no component K(2) 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.

• 出版日期2009-11-28