Premium
A generalization of edge‐coloring in graphs
Author(s) -
Louis Hakimi S.,
Kariv Oded
Publication year - 1986
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190100202
Subject(s) - combinatorics , multigraph , mathematics , edge coloring , mathematical proof , fractional coloring , brooks' theorem , vertex (graph theory) , list coloring , graph coloring , complete coloring , generalization , graph , greedy coloring , discrete mathematics , 1 planar graph , line graph , graph power , mathematical analysis , geometry
Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex v at most m (ν) times. The known results and proofs generalize in natural ways. Certain new edge‐coloring problems, which have no counterparts when m (ν) = 1 for all ν ϵ V , are studied.