On edge covering colorings of graphs

  • Authors:

  • Xia Zhang;Guizhen Liu

  • Affiliations:

  • Department of Mathematics, Shandong Normal University, Jinan, Shandong 250014, PR China;School of Mathematics, Shandong University, Jinan, Shandong 250100, PR China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.89

Visualization

Abstract

An edge covering coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least one time. The maximum integer k such that G has an edge covering coloring with k colors is called the edge covering chromatic index of G and denoted by @g"c^'(G). It is known that for any graph G with minimum degree @d(G), it holds that @d(G)-1=