Title :
On the f-coloring of multigraphs
Author :
Nakano, Shin-Ichi ; Nishizeki, Takao ; Saito, Nobuji
Author_Institution :
Tohoku Univ., Sendai, Japan
fDate :
3/1/1988 12:00:00 AM
Abstract :
An f-coloring of a multigraph is a coloring of edges E such that each color appears at each vertex at most f times. The minimum number of colors needed to f-color G is called the f-chromatic index of G. Various scheduling problems on networks are reduced to finding an f-coloring of a multigraph. An upper bound on the f-chromatic index is given
Keywords :
graph colouring; network topology; scheduling; f-chromatic index; f-coloring; multigraphs; networks; scheduling problems; topology; upper bound; Application software; Approximation algorithms; Circuits and systems; Computer networks; Finishing; Polynomials; Processor scheduling; Upper bound;
Journal_Title :
Circuits and Systems, IEEE Transactions on
