A new type of edge-derived vertex coloring

Ervin Gyori, Cory Palmer

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


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.

Original languageEnglish
Pages (from-to)6344-6352
Number of pages9
JournalDiscrete Mathematics
Issue number22
StatePublished - Nov 28 2009


  • Chromatic number
  • Edge coloring
  • Edge-weighting


Dive into the research topics of 'A new type of edge-derived vertex coloring'. Together they form a unique fingerprint.

Cite this